java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:18:23,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:18:23,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:18:23,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:18:23,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:18:23,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:18:23,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:18:23,575 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:18:23,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:18:23,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:18:23,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:18:23,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:18:23,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:18:23,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:18:23,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:18:23,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:18:23,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:18:23,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:18:23,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:18:23,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:18:23,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:18:23,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:18:23,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:18:23,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:18:23,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:18:23,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:18:23,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:18:23,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:18:23,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:18:23,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:18:23,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:18:23,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:18:23,602 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:18:23,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:18:23,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:18:23,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:18:23,604 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:18:23,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:18:23,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:18:23,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:18:23,636 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:18:23,639 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:18:23,639 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:18:23,639 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:18:23,640 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:18:23,640 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:18:23,640 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:18:23,640 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:18:23,640 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:18:23,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:18:23,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:18:23,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:18:23,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:18:23,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:18:23,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:18:23,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:18:23,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:18:23,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:18:23,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:18:23,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:18:23,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:18:23,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:18:23,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:18:23,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:18:23,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:18:23,645 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:18:23,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:18:23,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:18:23,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:18:23,646 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:18:23,646 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:18:23,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:18:23,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:18:23,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:18:23,728 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:18:23,729 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:18:23,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-10-27 12:18:23,802 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c6f573f3d/9e8f45b66e8647bbb0e3d6998fc51fd8/FLAGe2a7d5d09 [2018-10-27 12:18:24,430 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:18:24,431 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-10-27 12:18:24,447 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c6f573f3d/9e8f45b66e8647bbb0e3d6998fc51fd8/FLAGe2a7d5d09 [2018-10-27 12:18:24,469 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c6f573f3d/9e8f45b66e8647bbb0e3d6998fc51fd8 [2018-10-27 12:18:24,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:18:24,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:18:24,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:18:24,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:18:24,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:18:24,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:24" (1/1) ... [2018-10-27 12:18:24,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6f7036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:24, skipping insertion in model container [2018-10-27 12:18:24,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:24" (1/1) ... [2018-10-27 12:18:24,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:18:24,558 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:18:24,982 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:18:24,988 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:18:25,121 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:18:25,148 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:18:25,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25 WrapperNode [2018-10-27 12:18:25,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:18:25,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:18:25,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:18:25,150 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:18:25,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:18:25,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:18:25,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:18:25,344 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:18:25,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... [2018-10-27 12:18:25,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:18:25,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:18:25,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:18:25,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:18:25,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:18:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:18:25,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:18:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:18:25,521 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:18:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:18:25,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:18:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:18:25,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:18:28,622 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:18:28,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:28 BoogieIcfgContainer [2018-10-27 12:18:28,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:18:28,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:18:28,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:18:28,632 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:18:28,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:18:24" (1/3) ... [2018-10-27 12:18:28,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27566634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:28, skipping insertion in model container [2018-10-27 12:18:28,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:25" (2/3) ... [2018-10-27 12:18:28,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27566634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:28, skipping insertion in model container [2018-10-27 12:18:28,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:28" (3/3) ... [2018-10-27 12:18:28,636 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label42_true-unreach-call_false-termination.c [2018-10-27 12:18:28,648 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:18:28,663 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:18:28,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:18:28,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:18:28,726 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:18:28,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:18:28,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:18:28,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:18:28,727 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:18:28,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:18:28,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:18:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 12:18:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-27 12:18:28,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:28,798 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:18:28,801 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:28,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1053299728, now seen corresponding path program 1 times [2018-10-27 12:18:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:28,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:28,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:29,489 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:18:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:29,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:29,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:18:29,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:29,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:18:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:18:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:29,645 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 12:18:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:31,222 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 12:18:31,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:18:31,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-10-27 12:18:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:31,244 INFO L225 Difference]: With dead ends: 550 [2018-10-27 12:18:31,245 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 12:18:31,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-27 12:18:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 12:18:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 12:18:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 12:18:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-10-27 12:18:31,344 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 122 [2018-10-27 12:18:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:31,345 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-10-27 12:18:31,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:18:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-10-27 12:18:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-27 12:18:31,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:31,352 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:18:31,353 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:31,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:31,353 INFO L82 PathProgramCache]: Analyzing trace with hash -693386961, now seen corresponding path program 1 times [2018-10-27 12:18:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:31,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:31,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:31,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:31,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:18:31,554 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:31,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:18:31,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:18:31,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:18:31,557 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-10-27 12:18:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:33,540 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-10-27 12:18:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:18:33,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-10-27 12:18:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:33,551 INFO L225 Difference]: With dead ends: 1075 [2018-10-27 12:18:33,552 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 12:18:33,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:18:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 12:18:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-27 12:18:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-27 12:18:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-10-27 12:18:33,610 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 133 [2018-10-27 12:18:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:33,611 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-10-27 12:18:33,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:18:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-10-27 12:18:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 12:18:33,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:33,616 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-10-27 12:18:33,616 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:33,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -214566269, now seen corresponding path program 1 times [2018-10-27 12:18:33,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:33,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:33,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:33,618 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:34,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:34,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:18:34,164 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:34,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:18:34,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:18:34,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:18:34,165 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-10-27 12:18:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:36,391 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-10-27 12:18:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:18:36,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-27 12:18:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:36,397 INFO L225 Difference]: With dead ends: 1578 [2018-10-27 12:18:36,397 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 12:18:36,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:18:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 12:18:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-27 12:18:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-27 12:18:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-10-27 12:18:36,459 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 134 [2018-10-27 12:18:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:36,459 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-10-27 12:18:36,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:18:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-10-27 12:18:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 12:18:36,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:36,466 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-27 12:18:36,466 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:36,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -441297109, now seen corresponding path program 1 times [2018-10-27 12:18:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:36,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:37,138 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 12:18:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:37,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:37,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:18:37,269 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:37,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:18:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:18:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:18:37,271 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-10-27 12:18:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:38,691 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-10-27 12:18:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:18:38,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-10-27 12:18:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:38,698 INFO L225 Difference]: With dead ends: 1572 [2018-10-27 12:18:38,698 INFO L226 Difference]: Without dead ends: 720 [2018-10-27 12:18:38,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:18:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-27 12:18:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-27 12:18:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-27 12:18:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-10-27 12:18:38,729 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 135 [2018-10-27 12:18:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:38,729 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-10-27 12:18:38,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:18:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-10-27 12:18:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-27 12:18:38,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:38,733 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 12:18:38,733 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:38,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash -689394821, now seen corresponding path program 1 times [2018-10-27 12:18:38,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:38,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:38,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:38,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:38,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:38,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:38,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:18:38,896 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:38,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:18:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:18:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:38,897 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-10-27 12:18:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:39,976 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-10-27 12:18:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:18:39,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-27 12:18:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:39,984 INFO L225 Difference]: With dead ends: 1882 [2018-10-27 12:18:39,984 INFO L226 Difference]: Without dead ends: 1168 [2018-10-27 12:18:39,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-27 12:18:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-10-27 12:18:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-10-27 12:18:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-10-27 12:18:40,020 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 138 [2018-10-27 12:18:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:40,021 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-10-27 12:18:40,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:18:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-10-27 12:18:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-27 12:18:40,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:40,027 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:18:40,028 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:40,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash -155247930, now seen corresponding path program 1 times [2018-10-27 12:18:40,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:40,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:40,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:40,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:40,184 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-10-27 12:18:40,186 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:40,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:40,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:40,838 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:18:40,840 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 12:18:40,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:40,873 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:18:41,307 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 79.64% of their original sizes. [2018-10-27 12:18:41,308 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:18:42,309 INFO L415 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-10-27 12:18:42,309 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:18:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:18:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-27 12:18:42,311 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:42,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 12:18:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 12:18:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:18:42,313 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 12 states. [2018-10-27 12:18:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:52,957 INFO L93 Difference]: Finished difference Result 2383 states and 3259 transitions. [2018-10-27 12:18:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 12:18:52,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2018-10-27 12:18:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:52,964 INFO L225 Difference]: With dead ends: 2383 [2018-10-27 12:18:52,964 INFO L226 Difference]: Without dead ends: 1225 [2018-10-27 12:18:52,968 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:18:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-27 12:18:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2018-10-27 12:18:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-27 12:18:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1658 transitions. [2018-10-27 12:18:53,001 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1658 transitions. Word has length 170 [2018-10-27 12:18:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:53,002 INFO L481 AbstractCegarLoop]: Abstraction has 1225 states and 1658 transitions. [2018-10-27 12:18:53,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 12:18:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1658 transitions. [2018-10-27 12:18:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 12:18:53,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:53,008 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 12:18:53,009 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:53,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1006399511, now seen corresponding path program 1 times [2018-10-27 12:18:53,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:53,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:53,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 12:18:53,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:53,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:53,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-27 12:18:53,272 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:53,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:53,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:53,647 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:18:53,647 INFO L272 AbstractInterpreter]: Visited 127 different actions 194 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:18:53,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:53,686 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:18:54,214 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 80.79% of their original sizes. [2018-10-27 12:18:54,214 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:18:56,008 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-10-27 12:18:56,008 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:18:56,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:18:56,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-10-27 12:18:56,009 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:56,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 12:18:56,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 12:18:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-10-27 12:18:56,011 INFO L87 Difference]: Start difference. First operand 1225 states and 1658 transitions. Second operand 20 states. [2018-10-27 12:19:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:13,749 INFO L93 Difference]: Finished difference Result 2668 states and 3644 transitions. [2018-10-27 12:19:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 12:19:13,749 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 179 [2018-10-27 12:19:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:13,757 INFO L225 Difference]: With dead ends: 2668 [2018-10-27 12:19:13,757 INFO L226 Difference]: Without dead ends: 1510 [2018-10-27 12:19:13,761 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 12:19:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-27 12:19:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1363. [2018-10-27 12:19:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2018-10-27 12:19:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1800 transitions. [2018-10-27 12:19:13,800 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1800 transitions. Word has length 179 [2018-10-27 12:19:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:13,801 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 1800 transitions. [2018-10-27 12:19:13,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 12:19:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1800 transitions. [2018-10-27 12:19:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-27 12:19:13,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:19:13,808 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-27 12:19:13,808 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:19:13,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1171173763, now seen corresponding path program 1 times [2018-10-27 12:19:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:19:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:13,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:13,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:19:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 12:19:14,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:14,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:19:14,084 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-27 12:19:14,085 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:19:14,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:19:14,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:19:14,468 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:19:14,468 INFO L272 AbstractInterpreter]: Visited 127 different actions 194 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:19:14,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:14,475 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:19:15,589 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 80.99% of their original sizes. [2018-10-27 12:19:15,589 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:19:17,104 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-10-27 12:19:17,105 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:19:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:19:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [6] total 33 [2018-10-27 12:19:17,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:19:17,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 12:19:17,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 12:19:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-10-27 12:19:17,107 INFO L87 Difference]: Start difference. First operand 1363 states and 1800 transitions. Second operand 29 states. [2018-10-27 12:19:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:31,440 INFO L93 Difference]: Finished difference Result 2943 states and 3921 transitions. [2018-10-27 12:19:31,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 12:19:31,440 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 212 [2018-10-27 12:19:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:31,449 INFO L225 Difference]: With dead ends: 2943 [2018-10-27 12:19:31,449 INFO L226 Difference]: Without dead ends: 1785 [2018-10-27 12:19:31,453 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=438, Invalid=1542, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 12:19:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2018-10-27 12:19:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1637. [2018-10-27 12:19:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2018-10-27 12:19:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2092 transitions. [2018-10-27 12:19:31,499 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2092 transitions. Word has length 212 [2018-10-27 12:19:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:31,499 INFO L481 AbstractCegarLoop]: Abstraction has 1637 states and 2092 transitions. [2018-10-27 12:19:31,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 12:19:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2092 transitions. [2018-10-27 12:19:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 12:19:31,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:19:31,507 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2018-10-27 12:19:31,507 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:19:31,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash 47880722, now seen corresponding path program 1 times [2018-10-27 12:19:31,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:19:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:31,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:31,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:19:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 12:19:31,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:31,745 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:19:31,745 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-27 12:19:31,745 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:19:31,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:19:31,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:19:32,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:19:32,895 INFO L272 AbstractInterpreter]: Visited 129 different actions 594 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:19:32,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:32,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:19:32,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:32,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:19:32,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:32,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:19:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:33,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:19:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 12:19:33,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:19:33,735 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 12:19:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 14 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 12:19:34,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:19:34,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 12:19:34,369 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:19:34,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 12:19:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 12:19:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:19:34,371 INFO L87 Difference]: Start difference. First operand 1637 states and 2092 transitions. Second operand 12 states. [2018-10-27 12:19:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:41,167 INFO L93 Difference]: Finished difference Result 6513 states and 9748 transitions. [2018-10-27 12:19:41,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-27 12:19:41,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 221 [2018-10-27 12:19:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:41,202 INFO L225 Difference]: With dead ends: 6513 [2018-10-27 12:19:41,202 INFO L226 Difference]: Without dead ends: 5081 [2018-10-27 12:19:41,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 473 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 12:19:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2018-10-27 12:19:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 4884. [2018-10-27 12:19:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4884 states. [2018-10-27 12:19:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 6764 transitions. [2018-10-27 12:19:41,403 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 6764 transitions. Word has length 221 [2018-10-27 12:19:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:41,403 INFO L481 AbstractCegarLoop]: Abstraction has 4884 states and 6764 transitions. [2018-10-27 12:19:41,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 12:19:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 6764 transitions. [2018-10-27 12:19:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 12:19:41,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:19:41,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2018-10-27 12:19:41,433 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:19:41,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1971973010, now seen corresponding path program 1 times [2018-10-27 12:19:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:19:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:41,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:19:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:41,947 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 12:19:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 12:19:42,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:42,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:19:42,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-10-27 12:19:42,045 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:19:42,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:19:42,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:19:42,715 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:19:42,715 INFO L272 AbstractInterpreter]: Visited 128 different actions 324 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-27 12:19:42,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:42,756 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:19:43,306 INFO L227 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 80.39% of their original sizes. [2018-10-27 12:19:43,306 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:19:43,964 INFO L415 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2018-10-27 12:19:43,965 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:19:43,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:19:43,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 12:19:43,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:19:43,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:19:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:19:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:19:43,966 INFO L87 Difference]: Start difference. First operand 4884 states and 6764 transitions. Second operand 11 states. [2018-10-27 12:19:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:52,361 INFO L93 Difference]: Finished difference Result 9983 states and 13937 transitions. [2018-10-27 12:19:52,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 12:19:52,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-10-27 12:19:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:52,389 INFO L225 Difference]: With dead ends: 9983 [2018-10-27 12:19:52,389 INFO L226 Difference]: Without dead ends: 5442 [2018-10-27 12:19:52,413 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-10-27 12:19:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2018-10-27 12:19:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 5432. [2018-10-27 12:19:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5432 states. [2018-10-27 12:19:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5432 states to 5432 states and 7356 transitions. [2018-10-27 12:19:52,596 INFO L78 Accepts]: Start accepts. Automaton has 5432 states and 7356 transitions. Word has length 230 [2018-10-27 12:19:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:52,596 INFO L481 AbstractCegarLoop]: Abstraction has 5432 states and 7356 transitions. [2018-10-27 12:19:52,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:19:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5432 states and 7356 transitions. [2018-10-27 12:19:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-27 12:19:52,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:19:52,628 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 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] [2018-10-27 12:19:52,629 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:19:52,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1082069636, now seen corresponding path program 1 times [2018-10-27 12:19:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:19:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:52,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:52,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:52,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:19:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 12:19:53,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:53,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:19:53,250 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-27 12:19:53,250 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [613], [615], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:19:53,253 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:19:53,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:19:59,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:19:59,128 INFO L272 AbstractInterpreter]: Visited 129 different actions 3077 times. Merged at 9 different actions 291 times. Widened at 1 different actions 21 times. Found 67 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:19:59,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:59,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:19:59,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:59,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 12:19:59,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:59,144 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:19:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:59,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:19:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 12:19:59,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:20:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 12:20:00,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:20:00,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-10-27 12:20:00,142 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:20:00,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:20:00,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:20:00,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:20:00,143 INFO L87 Difference]: Start difference. First operand 5432 states and 7356 transitions. Second operand 11 states. [2018-10-27 12:20:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:20:05,432 INFO L93 Difference]: Finished difference Result 13827 states and 26009 transitions. [2018-10-27 12:20:05,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 12:20:05,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-10-27 12:20:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:20:05,433 INFO L225 Difference]: With dead ends: 13827 [2018-10-27 12:20:05,434 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:20:05,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 510 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 12:20:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:20:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:20:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:20:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:20:05,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-10-27 12:20:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:20:05,560 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:20:05,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:20:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:20:05,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:20:05,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:20:06,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:06,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,562 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 645 DAG size of output: 193 [2018-10-27 12:20:07,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:07,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:08,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:20:09,002 WARN L179 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 645 DAG size of output: 209 [2018-10-27 12:20:10,045 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-27 12:20:11,201 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-10-27 12:20:14,071 WARN L179 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 315 DAG size of output: 100 [2018-10-27 12:20:14,883 WARN L179 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 105 [2018-10-27 12:20:15,521 WARN L179 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 105 [2018-10-27 12:20:15,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:20:15,525 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-10-27 12:20:15,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:20:15,525 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 12:20:15,526 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 12:20:15,527 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 12:20:15,528 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 12:20:15,529 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 12:20:15,530 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,531 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 12:20:15,532 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,533 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 12:20:15,534 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,535 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 12:20:15,536 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,537 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 12:20:15,538 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 12:20:15,539 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 12:20:15,540 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse18 (= 1 |old(~a17~0)|)) (.cse15 (= 13 |old(~a8~0)|)) (.cse19 (= ~a7~0 |old(~a7~0)|)) (.cse20 (= |old(~a20~0)| ~a20~0)) (.cse21 (= ~a17~0 |old(~a17~0)|)) (.cse22 (<= ~a21~0 |old(~a21~0)|)) (.cse8 (= |old(~a16~0)| ~a16~0))) (let ((.cse14 (and .cse19 .cse20 .cse21 .cse22 .cse8 (not (= ~a8~0 13)))) (.cse13 (= 6 |old(~a16~0)|)) (.cse0 (and (= ~a8~0 15) (= ~a21~0 1))) (.cse1 (not (= 0 |old(~a7~0)|))) (.cse4 (not (= 15 |old(~a8~0)|))) (.cse2 (not (= 1 |old(~a21~0)|))) (.cse10 (not .cse15)) (.cse11 (not .cse18)) (.cse9 (= 1 |old(~a7~0)|)) (.cse7 (not (= 4 |old(~a16~0)|))) (.cse3 (not (= 1 |old(~a20~0)|))) (.cse12 (and .cse19 .cse20 .cse21 .cse22 .cse8)) (.cse5 (not (= 8 ~a12~0))) (.cse6 (< 0 |old(~a17~0)|)) (.cse16 (< 0 |old(~a21~0)|))) (and (or .cse0 (or (or .cse1 .cse2 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse3 .cse4 (< |old(~a17~0)| 0) .cse5) .cse6)) (or .cse2 .cse3 .cse7 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse8 (= 1 ~a17~0)) .cse5 (not .cse9) .cse10 .cse11) (or .cse9 .cse3 .cse12 .cse5 .cse11) (or .cse13 .cse14 .cse15 .cse5 .cse6) (or .cse9 .cse14 .cse15 .cse5) (or .cse13 .cse12 .cse5 .cse16) (or (< 6 |calculate_output_#in~input|) .cse0 (let ((.cse17 (not (= 5 |old(~a16~0)|)))) (and (or .cse1 .cse2 .cse4 (not (= 0 |old(~a17~0)|)) (not (= 0 |old(~a20~0)|)) .cse17 .cse5) (or .cse1 .cse2 .cse4 .cse17 .cse5 (< 1 |old(~a20~0)|) (< |old(~a20~0)| 0) .cse11))) (< |calculate_output_#in~input| 1)) (or .cse2 .cse3 .cse7 .cse5 (and (= 13 ~a8~0) (= 1 ~a21~0)) .cse10 .cse11) (or .cse9 .cse12 .cse7 .cse5 .cse18) (or .cse3 .cse12 .cse5 .cse6 .cse16)))) [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 12:20:15,541 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 12:20:15,542 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,543 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 12:20:15,544 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 12:20:15,545 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 12:20:15,546 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:20:15,547 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-27 12:20:15,547 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:20:15,548 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:20:15,548 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:20:15,548 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:20:15,548 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (not (= ~a8~0 13))) (.cse1 (<= ~a17~0 0)) (.cse5 (= 1 ~a20~0)) (.cse3 (not (= ~a7~0 1))) (.cse4 (<= ~a21~0 0)) (.cse0 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= ~a16~0 4) (not (= ~a17~0 1))) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse3 .cse2) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse4 .cse5 .cse1) (and .cse5 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (and .cse3 (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and .cse4 .cse0) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-27 12:20:15,548 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 12:20:15,548 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 12:20:15,549 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 12:20:15,549 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a8~0 13))) (.cse1 (<= ~a17~0 0)) (.cse5 (= 1 ~a20~0)) (.cse3 (not (= ~a7~0 1))) (.cse4 (<= ~a21~0 0)) (.cse0 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= ~a16~0 4) (not (= ~a17~0 1))) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse3 .cse2) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse4 .cse5 .cse1) (and .cse5 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (and .cse3 (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and .cse4 .cse0) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-27 12:20:15,549 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:20:15,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:20:15 BoogieIcfgContainer [2018-10-27 12:20:15,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:20:15,566 INFO L168 Benchmark]: Toolchain (without parser) took 111084.71 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-27 12:20:15,567 INFO L168 Benchmark]: CDTParser took 0.21 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-10-27 12:20:15,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.86 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:20:15,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 12:20:15,569 INFO L168 Benchmark]: Boogie Preprocessor took 78.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-27 12:20:15,570 INFO L168 Benchmark]: RCFGBuilder took 3201.54 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: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-10-27 12:20:15,571 INFO L168 Benchmark]: TraceAbstraction took 106940.22 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 12:20:15,576 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.21 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 665.86 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 193.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3201.54 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: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106940.22 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(a16 == 6) && a17 <= 0) && !(a8 == 13)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || !(x == 24)) || (!(a7 == 1) && !(a8 == 13))) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || ((a21 <= 0 && 1 == a20) && a17 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || ((!(a7 == 1) && \old(a20) == a20) && a17 == \old(a17))) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || (a21 <= 0 && !(a16 == 6))) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 106.8s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 71.8s AutomataDifference, 0.0s DeadEndRemovalTime, 9.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1544 SDtfs, 11045 SDslu, 2448 SDs, 0 SdLazy, 15505 SolverSat, 2647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1945 GetRequests, 1718 SyntacticMatches, 13 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1966 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5432occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.2s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9973249713810398 AbsIntWeakeningRatio, 0.20838627700127066 AbsIntAvgWeakeningVarsNumRemoved, 18.59466327827192 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 523 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 604 PreInvPairs, 1486 NumberOfFragments, 871 HoareAnnotationTreeSize, 604 FomulaSimplifications, 43712 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8318 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2387 NumberOfCodeBlocks, 2387 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2839 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724391 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1634/1820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...