java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:08:53,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:08:53,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:08:53,541 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:08:53,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:08:53,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:08:53,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:08:53,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:08:53,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:08:53,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:08:53,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:08:53,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:08:53,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:08:53,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:08:53,553 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:08:53,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:08:53,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:08:53,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:08:53,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:08:53,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:08:53,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:08:53,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:08:53,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:08:53,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:08:53,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:08:53,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:08:53,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:08:53,572 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:08:53,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:08:53,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:08:53,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:08:53,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:08:53,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:08:53,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:08:53,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:08:53,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:08:53,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:08:53,594 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:08:53,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:08:53,595 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:08:53,595 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:08:53,595 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:08:53,595 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:08:53,596 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:08:53,596 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:08:53,596 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:08:53,596 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:08:53,596 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:08:53,597 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:08:53,597 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:08:53,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:08:53,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:08:53,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:08:53,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:08:53,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:08:53,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:08:53,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:08:53,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:08:53,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:08:53,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:08:53,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:08:53,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:08:53,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:08:53,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:08:53,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:08:53,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:08:53,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:08:53,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:08:53,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:08:53,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:08:53,602 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:08:53,602 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:08:53,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:08:53,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:08:53,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:08:53,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:08:53,670 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:08:53,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-12 17:08:53,740 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7cadbfd/0117229d78b34d79bee576b88a200c52/FLAG2516f160f [2018-11-12 17:08:54,315 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:08:54,316 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-12 17:08:54,332 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7cadbfd/0117229d78b34d79bee576b88a200c52/FLAG2516f160f [2018-11-12 17:08:54,351 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7cadbfd/0117229d78b34d79bee576b88a200c52 [2018-11-12 17:08:54,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:08:54,367 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:08:54,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:08:54,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:08:54,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:08:54,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:08:54" (1/1) ... [2018-11-12 17:08:54,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f7840e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:54, skipping insertion in model container [2018-11-12 17:08:54,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:08:54" (1/1) ... [2018-11-12 17:08:54,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:08:54,457 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:08:55,007 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:08:55,011 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:08:55,108 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:08:55,127 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:08:55,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55 WrapperNode [2018-11-12 17:08:55,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:08:55,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:08:55,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:08:55,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:08:55,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:08:55,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:08:55,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:08:55,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:08:55,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... [2018-11-12 17:08:55,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:08:55,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:08:55,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:08:55,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:08:55,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:08:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:08:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:08:55,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:08:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:08:55,492 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:08:55,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:08:55,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:08:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:08:55,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:08:58,782 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:08:58,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:08:58 BoogieIcfgContainer [2018-11-12 17:08:58,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:08:58,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:08:58,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:08:58,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:08:58,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:08:54" (1/3) ... [2018-11-12 17:08:58,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640a96e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:08:58, skipping insertion in model container [2018-11-12 17:08:58,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:55" (2/3) ... [2018-11-12 17:08:58,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640a96e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:08:58, skipping insertion in model container [2018-11-12 17:08:58,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:08:58" (3/3) ... [2018-11-12 17:08:58,799 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23_true-unreach-call_false-termination.c [2018-11-12 17:08:58,811 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:08:58,824 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:08:58,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:08:58,890 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:08:58,890 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:08:58,890 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:08:58,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:08:58,891 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:08:58,891 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:08:58,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:08:58,892 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:08:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:08:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-12 17:08:58,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:58,950 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] [2018-11-12 17:08:58,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:58,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1921053824, now seen corresponding path program 1 times [2018-11-12 17:08:58,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:59,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:59,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:59,551 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:08:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:08:59,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:08:59,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:08:59,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:59,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:08:59,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:08:59,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:08:59,638 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:09:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:00,974 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:09:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:00,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-12 17:09:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:01,003 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:09:01,003 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:09:01,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:09:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:09:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:09:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-12 17:09:01,090 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 102 [2018-11-12 17:09:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:01,091 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-12 17:09:01,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-12 17:09:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 17:09:01,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:01,097 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] [2018-11-12 17:09:01,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:01,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1248804383, now seen corresponding path program 1 times [2018-11-12 17:09:01,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:01,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:01,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:09:01,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:01,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:09:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:09:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:09:01,338 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-12 17:09:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:03,206 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-12 17:09:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:03,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-12 17:09:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:03,213 INFO L225 Difference]: With dead ends: 888 [2018-11-12 17:09:03,213 INFO L226 Difference]: Without dead ends: 554 [2018-11-12 17:09:03,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-12 17:09:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-12 17:09:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-12 17:09:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-12 17:09:03,256 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 113 [2018-11-12 17:09:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:03,257 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-12 17:09:03,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:09:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-12 17:09:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-12 17:09:03,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:03,262 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] [2018-11-12 17:09:03,262 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:03,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2079561357, now seen corresponding path program 1 times [2018-11-12 17:09:03,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:03,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:03,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:03,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:03,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:03,505 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-12 17:09:03,507 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:03,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:03,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:04,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:09:04,971 INFO L272 AbstractInterpreter]: Visited 106 different actions 170 times. Merged at 4 different actions 4 times. Never widened. Performed 2288 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2288 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:05,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:05,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:09:05,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:05,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:09:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:05,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:09:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:05,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:09:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:05,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:09:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:05,760 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:05,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-12 17:09:05,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:05,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:05,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:05,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:05,762 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-12 17:09:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:07,229 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-11-12 17:09:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:07,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-12 17:09:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:07,239 INFO L225 Difference]: With dead ends: 1530 [2018-11-12 17:09:07,239 INFO L226 Difference]: Without dead ends: 997 [2018-11-12 17:09:07,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-12 17:09:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-12 17:09:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-12 17:09:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-11-12 17:09:07,285 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 114 [2018-11-12 17:09:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:07,286 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-11-12 17:09:07,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-11-12 17:09:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-12 17:09:07,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:07,291 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:09:07,292 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:07,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash 896515303, now seen corresponding path program 1 times [2018-11-12 17:09:07,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:07,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:07,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:07,566 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:09:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:07,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:07,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:07,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:07,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:07,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:07,620 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-11-12 17:09:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:09,321 INFO L93 Difference]: Finished difference Result 2438 states and 3658 transitions. [2018-11-12 17:09:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:09,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-12 17:09:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:09,331 INFO L225 Difference]: With dead ends: 2438 [2018-11-12 17:09:09,331 INFO L226 Difference]: Without dead ends: 1447 [2018-11-12 17:09:09,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-11-12 17:09:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2018-11-12 17:09:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-11-12 17:09:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2086 transitions. [2018-11-12 17:09:09,382 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2086 transitions. Word has length 120 [2018-11-12 17:09:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:09,383 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 2086 transitions. [2018-11-12 17:09:09,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2086 transitions. [2018-11-12 17:09:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-12 17:09:09,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:09,390 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:09,391 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:09,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1267173673, now seen corresponding path program 1 times [2018-11-12 17:09:09,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:09,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:09,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:09,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:09,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:09:09,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:09,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:09:09,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:09:09,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:09:09,611 INFO L87 Difference]: Start difference. First operand 1447 states and 2086 transitions. Second operand 6 states. [2018-11-12 17:09:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:11,137 INFO L93 Difference]: Finished difference Result 3031 states and 4481 transitions. [2018-11-12 17:09:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:11,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-12 17:09:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:11,152 INFO L225 Difference]: With dead ends: 3031 [2018-11-12 17:09:11,152 INFO L226 Difference]: Without dead ends: 1590 [2018-11-12 17:09:11,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-11-12 17:09:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1540. [2018-11-12 17:09:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-11-12 17:09:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1980 transitions. [2018-11-12 17:09:11,219 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1980 transitions. Word has length 128 [2018-11-12 17:09:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:11,219 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 1980 transitions. [2018-11-12 17:09:11,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:09:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1980 transitions. [2018-11-12 17:09:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 17:09:11,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:11,225 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:11,225 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:11,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1675141633, now seen corresponding path program 1 times [2018-11-12 17:09:11,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:11,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:11,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:11,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:11,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:11,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:11,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:11,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:11,415 INFO L87 Difference]: Start difference. First operand 1540 states and 1980 transitions. Second operand 3 states. [2018-11-12 17:09:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:12,267 INFO L93 Difference]: Finished difference Result 4456 states and 5895 transitions. [2018-11-12 17:09:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:12,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-11-12 17:09:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:12,286 INFO L225 Difference]: With dead ends: 4456 [2018-11-12 17:09:12,286 INFO L226 Difference]: Without dead ends: 2922 [2018-11-12 17:09:12,301 INFO L604 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-11-12 17:09:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-11-12 17:09:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2914. [2018-11-12 17:09:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2018-11-12 17:09:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3698 transitions. [2018-11-12 17:09:12,384 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3698 transitions. Word has length 129 [2018-11-12 17:09:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:12,385 INFO L480 AbstractCegarLoop]: Abstraction has 2914 states and 3698 transitions. [2018-11-12 17:09:12,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3698 transitions. [2018-11-12 17:09:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-12 17:09:12,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:12,396 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:12,396 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:12,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash 208675339, now seen corresponding path program 1 times [2018-11-12 17:09:12,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:12,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:12,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:12,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:12,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:12,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-11-12 17:09:12,889 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:12,894 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:12,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:13,452 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:13,453 INFO L272 AbstractInterpreter]: Visited 105 different actions 170 times. Merged at 5 different actions 5 times. Never widened. Performed 2255 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:13,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:13,491 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:14,453 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 82.5% of their original sizes. [2018-11-12 17:09:14,453 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:15,145 INFO L415 sIntCurrentIteration]: We unified 165 AI predicates to 165 [2018-11-12 17:09:15,145 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:15,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:15,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-12 17:09:15,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:15,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:09:15,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:09:15,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:09:15,148 INFO L87 Difference]: Start difference. First operand 2914 states and 3698 transitions. Second operand 12 states. [2018-11-12 17:09:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:30,102 INFO L93 Difference]: Finished difference Result 6510 states and 8436 transitions. [2018-11-12 17:09:30,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:09:30,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-11-12 17:09:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:30,118 INFO L225 Difference]: With dead ends: 6510 [2018-11-12 17:09:30,118 INFO L226 Difference]: Without dead ends: 3602 [2018-11-12 17:09:30,129 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:09:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2018-11-12 17:09:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3599. [2018-11-12 17:09:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2018-11-12 17:09:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4469 transitions. [2018-11-12 17:09:30,210 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4469 transitions. Word has length 166 [2018-11-12 17:09:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:30,211 INFO L480 AbstractCegarLoop]: Abstraction has 3599 states and 4469 transitions. [2018-11-12 17:09:30,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:09:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4469 transitions. [2018-11-12 17:09:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-12 17:09:30,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:30,224 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:30,224 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:30,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2117677329, now seen corresponding path program 1 times [2018-11-12 17:09:30,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:30,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:30,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:30,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:09:30,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:30,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:30,432 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-12 17:09:30,432 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:30,436 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:30,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:31,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:31,684 INFO L272 AbstractInterpreter]: Visited 107 different actions 497 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Performed 7324 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7324 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:09:31,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:31,694 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:32,246 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 80.17% of their original sizes. [2018-11-12 17:09:32,246 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:33,204 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-12 17:09:33,205 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:33,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:33,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-12 17:09:33,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:33,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:09:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:09:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:09:33,206 INFO L87 Difference]: Start difference. First operand 3599 states and 4469 transitions. Second operand 11 states. [2018-11-12 17:09:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:43,871 INFO L93 Difference]: Finished difference Result 7343 states and 9383 transitions. [2018-11-12 17:09:43,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 17:09:43,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 195 [2018-11-12 17:09:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:43,890 INFO L225 Difference]: With dead ends: 7343 [2018-11-12 17:09:43,890 INFO L226 Difference]: Without dead ends: 4435 [2018-11-12 17:09:43,899 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:09:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2018-11-12 17:09:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4428. [2018-11-12 17:09:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2018-11-12 17:09:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 5564 transitions. [2018-11-12 17:09:44,004 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 5564 transitions. Word has length 195 [2018-11-12 17:09:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:44,004 INFO L480 AbstractCegarLoop]: Abstraction has 4428 states and 5564 transitions. [2018-11-12 17:09:44,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:09:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 5564 transitions. [2018-11-12 17:09:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-12 17:09:44,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:44,021 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:44,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:44,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1122503782, now seen corresponding path program 1 times [2018-11-12 17:09:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:44,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:09:44,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:44,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:44,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-12 17:09:44,345 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:44,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:44,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:45,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:09:45,121 INFO L272 AbstractInterpreter]: Visited 109 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 5560 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5560 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:09:45,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:45,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:09:45,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:45,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:09:45,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:45,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:09:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:45,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:09:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-12 17:09:45,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:09:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:09:45,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:09:45,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:09:45,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:09:45,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:09:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:09:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:09:45,661 INFO L87 Difference]: Start difference. First operand 4428 states and 5564 transitions. Second operand 9 states. [2018-11-12 17:09:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:49,179 INFO L93 Difference]: Finished difference Result 11487 states and 15108 transitions. [2018-11-12 17:09:49,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:09:49,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2018-11-12 17:09:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:49,220 INFO L225 Difference]: With dead ends: 11487 [2018-11-12 17:09:49,221 INFO L226 Difference]: Without dead ends: 7039 [2018-11-12 17:09:49,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:09:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-11-12 17:09:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 6982. [2018-11-12 17:09:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6982 states. [2018-11-12 17:09:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6982 states to 6982 states and 8976 transitions. [2018-11-12 17:09:49,453 INFO L78 Accepts]: Start accepts. Automaton has 6982 states and 8976 transitions. Word has length 219 [2018-11-12 17:09:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:49,454 INFO L480 AbstractCegarLoop]: Abstraction has 6982 states and 8976 transitions. [2018-11-12 17:09:49,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:09:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6982 states and 8976 transitions. [2018-11-12 17:09:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-12 17:09:49,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:49,491 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:49,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:49,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash 889346168, now seen corresponding path program 1 times [2018-11-12 17:09:49,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:49,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:49,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 130 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:09:49,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:49,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:49,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-12 17:09:49,904 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [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], [225], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:49,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:49,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:50,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:09:50,623 INFO L272 AbstractInterpreter]: Visited 109 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 5961 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5961 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-12 17:09:50,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:50,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:09:50,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:50,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:09:50,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:50,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:09:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:50,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:09:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-12 17:09:50,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:09:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-12 17:09:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:09:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:09:51,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:09:51,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:09:51,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:09:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:09:51,010 INFO L87 Difference]: Start difference. First operand 6982 states and 8976 transitions. Second operand 9 states. [2018-11-12 17:09:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:54,190 INFO L93 Difference]: Finished difference Result 19735 states and 26687 transitions. [2018-11-12 17:09:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:09:54,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2018-11-12 17:09:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:54,195 INFO L225 Difference]: With dead ends: 19735 [2018-11-12 17:09:54,195 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:09:54,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:09:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:09:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:09:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:09:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:09:54,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-12 17:09:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:54,279 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:09:54,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:09:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:09:54,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:09:54,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:09:54,608 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-12 17:09:55,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:55,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,373 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 397 DAG size of output: 262 [2018-11-12 17:09:56,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:56,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:57,226 WARN L179 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 251 [2018-11-12 17:09:58,275 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-12 17:09:58,801 WARN L179 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 86 [2018-11-12 17:10:02,795 WARN L179 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 385 DAG size of output: 165 [2018-11-12 17:10:04,250 WARN L179 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 290 DAG size of output: 98 [2018-11-12 17:10:05,587 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 278 DAG size of output: 98 [2018-11-12 17:10:05,590 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:10:05,591 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a21~0 |old(~a21~0)|)) [2018-11-12 17:10:05,591 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:10:05,591 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:10:05,591 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:10:05,592 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:10:05,593 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,594 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:10:05,595 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:10:05,596 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:10:05,597 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,598 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:10:05,599 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:10:05,600 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,601 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:10:05,602 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,603 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:10:05,604 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:10:05,605 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:10:05,606 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,607 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:10:05,608 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:10:05,609 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:10:05,609 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:10:05,609 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:10:05,609 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:10:05,609 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2018-11-12 17:10:05,611 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse14 (= 4 |old(~a16~0)|)) (.cse19 (= |old(~a8~0)| ~a8~0)) (.cse20 (= |old(~a16~0)| ~a16~0)) (.cse18 (not (= 0 |old(~a7~0)|))) (.cse7 (not (= 1 |old(~a21~0)|))) (.cse13 (= 15 |old(~a8~0)|)) (.cse4 (= ~a7~0 0)) (.cse5 (let ((.cse26 (<= 0 ~a17~0)) (.cse27 (= ~a8~0 15))) (or (and .cse26 .cse27 (<= ~a16~0 6)) (and .cse26 (<= 0 ~a20~0) .cse27 (<= ~a17~0 1)))))) (let ((.cse10 (and (<= 0 (+ ~a20~0 1)) .cse4 .cse5 (<= ~a20~0 1))) (.cse11 (< 8 |old(~a16~0)|)) (.cse3 (let ((.cse21 (not .cse13)) (.cse22 (< |old(~a16~0)| 4)) (.cse23 (< |old(~a17~0)| 0)) (.cse24 (not (= 8 ~a12~0))) (.cse25 (< 1 |old(~a20~0)|))) (and (or .cse18 .cse7 .cse21 .cse22 .cse23 .cse24 (< 1 |old(~a17~0)|) .cse25 (< |old(~a20~0)| 0)) (or .cse18 .cse7 (< 6 |old(~a16~0)|) (< 2 |old(~a17~0)|) .cse21 .cse22 .cse23 (< (+ |old(~a20~0)| 1) 0) .cse24 .cse25)))) (.cse2 (< 0 |old(~a17~0)|)) (.cse15 (and (<= ~a17~0 |old(~a17~0)|) .cse19 .cse20 (= ~a21~0 |old(~a21~0)|))) (.cse16 (= ~a20~0 1)) (.cse6 (< |calculate_output_#in~input| 1)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse12 (not (= |old(~a16~0)| 5))) (.cse17 (< 13 |old(~a8~0)|)) (.cse1 (not .cse14)) (.cse9 (= 1 |old(~a20~0)|)) (.cse8 (not (= 1 ~a20~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6) (or .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse9 .cse3 .cse11 .cse6) (or .cse8 .cse12 .cse9 .cse13) (or .cse0 .cse10 .cse14 .cse3 .cse11 .cse6) (or .cse7 .cse15 .cse14) (or .cse0 .cse2 (or (not .cse9) (< 5 |old(~a16~0)|)) .cse16 .cse3 .cse6) (or .cse17 .cse2 .cse15) (or (= 6 |old(~a16~0)|) .cse17 .cse15) (or .cse15 .cse7 .cse2) (or .cse7 .cse15 .cse13) (or .cse7 .cse9 .cse15) (or (and (= ~a17~0 1) .cse16) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) .cse12 .cse6 .cse18 .cse0 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or (and .cse19 .cse20) .cse12 .cse13) (or .cse17 .cse1 .cse9 .cse8)))) [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,612 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:10:05,613 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,614 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:10:05,615 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:10:05,616 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:10:05,617 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:10:05,618 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:10:05,619 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:10:05,619 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:10:05,619 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) (= ~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) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-12 17:10:05,619 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:10:05,619 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:10:05,620 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= |old(~a8~0)| ~a8~0) (= 1 ~a21~0) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (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-11-12 17:10:05,620 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:10:05,620 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-12 17:10:05,620 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:10:05,620 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:10:05,620 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:10:05,621 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-12 17:10:05,621 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:10:05,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:10:05 BoogieIcfgContainer [2018-11-12 17:10:05,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:10:05,645 INFO L168 Benchmark]: Toolchain (without parser) took 71278.42 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -158.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:10:05,646 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:10:05,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.55 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-11-12 17:10:05,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -844.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:05,650 INFO L168 Benchmark]: Boogie Preprocessor took 138.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:05,651 INFO L168 Benchmark]: RCFGBuilder took 3364.87 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:10:05,652 INFO L168 Benchmark]: TraceAbstraction took 66856.50 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 523.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:10:05,658 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.29 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 759.55 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 153.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -844.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3364.87 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66856.50 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 523.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: (((((((((((((((((((((((((a8 <= 13 && !(a16 == 6)) || (\old(a16) == a16 && !(a8 == 15))) || !(3 == c)) || (!(a8 == 15) && 1 == a21)) || !(1 == \old(a21))) || (a8 <= 13 && a17 <= 0)) || !(4 == d)) || (!(1 == a20) && 1 == a21)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || (1 == a21 && a17 <= 0)) || !(a12 == 8)) || !(e == 5)) || (1 == a21 && !(a16 == 4))) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 66.7s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 41.4s AutomataDifference, 0.0s DeadEndRemovalTime, 11.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1864 SDtfs, 6400 SDslu, 1590 SDs, 0 SdLazy, 11440 SolverSat, 1862 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1592 GetRequests, 1478 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6982occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.9s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9977671317994072 AbsIntWeakeningRatio, 0.19498607242339833 AbsIntAvgWeakeningVarsNumRemoved, 33.75487465181058 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 140 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 353 PreInvPairs, 715 NumberOfFragments, 1207 HoareAnnotationTreeSize, 353 FomulaSimplifications, 32452 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 23241 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2608 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038605 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1369/1522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...