java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:17:55,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:17:55,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:17:55,286 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:17:55,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:17:55,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:17:55,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:17:55,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:17:55,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:17:55,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:17:55,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:17:55,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:17:55,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:17:55,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:17:55,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:17:55,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:17:55,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:17:55,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:17:55,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:17:55,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:17:55,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:17:55,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:17:55,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:17:55,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:17:55,321 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:17:55,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:17:55,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:17:55,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:17:55,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:17:55,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:17:55,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:17:55,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:17:55,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:17:55,332 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:17:55,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:17:55,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:17:55,335 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:17:55,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:17:55,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:17:55,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:17:55,356 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:17:55,356 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:17:55,357 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:17:55,357 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:17:55,357 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:17:55,357 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:17:55,357 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:17:55,358 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:17:55,358 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:17:55,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:17:55,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:17:55,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:17:55,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:17:55,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:17:55,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:17:55,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:17:55,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:17:55,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:17:55,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:17:55,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:17:55,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:17:55,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:17:55,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:17:55,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:17:55,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:17:55,362 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:17:55,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:17:55,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:17:55,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:17:55,362 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:17:55,362 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:17:55,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:17:55,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:17:55,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:17:55,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:17:55,441 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:17:55,442 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-10-27 12:17:55,505 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5a952cf54/992d8017cb7949df99013c9f2a5d945f/FLAG07c90ff80 [2018-10-27 12:17:56,049 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:17:56,050 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-10-27 12:17:56,077 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5a952cf54/992d8017cb7949df99013c9f2a5d945f/FLAG07c90ff80 [2018-10-27 12:17:56,099 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5a952cf54/992d8017cb7949df99013c9f2a5d945f [2018-10-27 12:17:56,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:17:56,115 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:17:56,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:17:56,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:17:56,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:17:56,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:56,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a802b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56, skipping insertion in model container [2018-10-27 12:17:56,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:56,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:17:56,213 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:17:56,656 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:17:56,661 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:17:56,756 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:17:56,773 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:17:56,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56 WrapperNode [2018-10-27 12:17:56,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:17:56,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:17:56,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:17:56,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:17:56,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:56,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:56,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:17:56,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:17:56,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:17:56,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:17:57,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... [2018-10-27 12:17:57,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:17:57,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:17:57,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:17:57,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:17:57,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:17:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:17:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:17:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:17:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:17:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:17:57,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:17:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:17:57,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:18:00,689 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:18:00,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:00 BoogieIcfgContainer [2018-10-27 12:18:00,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:18:00,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:18:00,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:18:00,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:18:00,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:17:56" (1/3) ... [2018-10-27 12:18:00,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d09779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:00, skipping insertion in model container [2018-10-27 12:18:00,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:17:56" (2/3) ... [2018-10-27 12:18:00,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d09779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:00, skipping insertion in model container [2018-10-27 12:18:00,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:00" (3/3) ... [2018-10-27 12:18:00,699 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label34_true-unreach-call_false-termination.c [2018-10-27 12:18:00,711 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:18:00,720 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:18:00,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:18:00,783 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:18:00,783 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:18:00,783 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:18:00,783 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:18:00,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:18:00,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:18:00,784 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:18:00,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:18:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 12:18:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 12:18:00,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:00,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:00,841 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:00,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1144269880, now seen corresponding path program 1 times [2018-10-27 12:18:00,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:00,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:01,533 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:18:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:01,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:01,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:18:01,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:01,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:18:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:18:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:01,689 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 12:18:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:03,513 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 12:18:03,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:18:03,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-10-27 12:18:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:03,536 INFO L225 Difference]: With dead ends: 550 [2018-10-27 12:18:03,537 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 12:18:03,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 12:18:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 12:18:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 12:18:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-10-27 12:18:03,634 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 112 [2018-10-27 12:18:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:03,636 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-10-27 12:18:03,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:18:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-10-27 12:18:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-27 12:18:03,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:03,645 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:03,646 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:03,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -255516033, now seen corresponding path program 1 times [2018-10-27 12:18:03,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:03,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:03,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:03,926 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:18:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:04,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:04,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:18:04,075 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:04,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:18:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:18:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:18:04,078 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-10-27 12:18:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:05,963 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-10-27 12:18:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:18:05,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-27 12:18:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:05,975 INFO L225 Difference]: With dead ends: 1079 [2018-10-27 12:18:05,975 INFO L226 Difference]: Without dead ends: 745 [2018-10-27 12:18:05,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 12:18:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-10-27 12:18:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-10-27 12:18:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-27 12:18:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-10-27 12:18:06,039 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 122 [2018-10-27 12:18:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:06,040 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-10-27 12:18:06,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:18:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-10-27 12:18:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 12:18:06,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:06,046 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:06,047 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:06,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash -289707029, now seen corresponding path program 1 times [2018-10-27 12:18:06,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:06,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:06,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:06,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:06,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:06,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:18:06,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:18:06,274 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:06,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:18:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:18:06,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:06,275 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 3 states. [2018-10-27 12:18:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:08,151 INFO L93 Difference]: Finished difference Result 1919 states and 3096 transitions. [2018-10-27 12:18:08,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:18:08,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-27 12:18:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:08,160 INFO L225 Difference]: With dead ends: 1919 [2018-10-27 12:18:08,161 INFO L226 Difference]: Without dead ends: 1192 [2018-10-27 12:18:08,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:18:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-10-27 12:18:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2018-10-27 12:18:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-10-27 12:18:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1735 transitions. [2018-10-27 12:18:08,217 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1735 transitions. Word has length 132 [2018-10-27 12:18:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:08,218 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 1735 transitions. [2018-10-27 12:18:08,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:18:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1735 transitions. [2018-10-27 12:18:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 12:18:08,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:08,223 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:08,223 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:08,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1523382030, now seen corresponding path program 1 times [2018-10-27 12:18:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:08,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:08,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:18:08,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:08,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:08,359 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-10-27 12:18:08,361 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [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], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:08,415 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:08,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:09,448 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:18:09,450 INFO L272 AbstractInterpreter]: Visited 116 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:18:09,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:09,496 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:18:10,029 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 80.4% of their original sizes. [2018-10-27 12:18:10,030 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:18:10,966 INFO L415 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2018-10-27 12:18:10,967 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:18:10,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:18:10,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 12:18:10,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:10,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:18:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:18:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:18:10,970 INFO L87 Difference]: Start difference. First operand 1192 states and 1735 transitions. Second operand 11 states. [2018-10-27 12:18:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:25,160 INFO L93 Difference]: Finished difference Result 3249 states and 4708 transitions. [2018-10-27 12:18:25,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:18:25,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-10-27 12:18:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:25,176 INFO L225 Difference]: With dead ends: 3249 [2018-10-27 12:18:25,177 INFO L226 Difference]: Without dead ends: 2063 [2018-10-27 12:18:25,182 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-10-27 12:18:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2018-10-27 12:18:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2036. [2018-10-27 12:18:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2018-10-27 12:18:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2679 transitions. [2018-10-27 12:18:25,262 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2679 transitions. Word has length 134 [2018-10-27 12:18:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:25,263 INFO L481 AbstractCegarLoop]: Abstraction has 2036 states and 2679 transitions. [2018-10-27 12:18:25,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:18:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2679 transitions. [2018-10-27 12:18:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 12:18:25,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:25,270 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:25,271 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:25,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash -521176307, now seen corresponding path program 1 times [2018-10-27 12:18:25,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:25,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:25,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:25,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 12:18:25,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:25,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:25,487 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-10-27 12:18:25,488 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:25,494 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:25,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:25,770 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:18:25,770 INFO L272 AbstractInterpreter]: Visited 117 different actions 184 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:18:25,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:25,776 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:18:26,114 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 81.52% of their original sizes. [2018-10-27 12:18:26,114 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:18:26,878 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-10-27 12:18:26,878 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:18:26,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:18:26,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:18:26,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:26,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:18:26,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:18:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:18:26,880 INFO L87 Difference]: Start difference. First operand 2036 states and 2679 transitions. Second operand 18 states. [2018-10-27 12:18:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:39,353 INFO L93 Difference]: Finished difference Result 4351 states and 5797 transitions. [2018-10-27 12:18:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 12:18:39,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2018-10-27 12:18:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:39,366 INFO L225 Difference]: With dead ends: 4351 [2018-10-27 12:18:39,366 INFO L226 Difference]: Without dead ends: 2457 [2018-10-27 12:18:39,373 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-10-27 12:18:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-10-27 12:18:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2447. [2018-10-27 12:18:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2018-10-27 12:18:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3132 transitions. [2018-10-27 12:18:39,442 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3132 transitions. Word has length 147 [2018-10-27 12:18:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:39,442 INFO L481 AbstractCegarLoop]: Abstraction has 2447 states and 3132 transitions. [2018-10-27 12:18:39,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:18:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3132 transitions. [2018-10-27 12:18:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 12:18:39,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:39,449 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:39,450 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:39,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash 644918266, now seen corresponding path program 1 times [2018-10-27 12:18:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:39,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:39,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:39,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 12:18:39,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:39,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:39,734 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-10-27 12:18:39,734 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [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], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:39,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:39,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:40,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:18:40,169 INFO L272 AbstractInterpreter]: Visited 118 different actions 308 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:18:40,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:40,174 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:18:40,419 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 80.41% of their original sizes. [2018-10-27 12:18:40,419 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:18:40,541 INFO L415 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-10-27 12:18:40,541 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:18:40,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:18:40,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-27 12:18:40,541 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:18:40,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:18:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:18:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:18:40,542 INFO L87 Difference]: Start difference. First operand 2447 states and 3132 transitions. Second operand 10 states. [2018-10-27 12:18:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:47,172 INFO L93 Difference]: Finished difference Result 4690 states and 6143 transitions. [2018-10-27 12:18:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 12:18:47,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-10-27 12:18:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:47,186 INFO L225 Difference]: With dead ends: 4690 [2018-10-27 12:18:47,186 INFO L226 Difference]: Without dead ends: 2796 [2018-10-27 12:18:47,193 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:18:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-10-27 12:18:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2504. [2018-10-27 12:18:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-10-27 12:18:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3228 transitions. [2018-10-27 12:18:47,262 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3228 transitions. Word has length 159 [2018-10-27 12:18:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:47,263 INFO L481 AbstractCegarLoop]: Abstraction has 2504 states and 3228 transitions. [2018-10-27 12:18:47,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:18:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3228 transitions. [2018-10-27 12:18:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 12:18:47,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:47,271 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:47,271 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:47,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1387665827, now seen corresponding path program 1 times [2018-10-27 12:18:47,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:47,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:47,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:47,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:47,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 12:18:47,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:47,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:47,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-27 12:18:47,570 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [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], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:47,582 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:47,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:49,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:18:49,057 INFO L272 AbstractInterpreter]: Visited 120 different actions 556 times. Merged at 10 different actions 47 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-27 12:18:49,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:49,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:18:49,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:49,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:18:49,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:49,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:18:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:49,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:18:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-27 12:18:49,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:18:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 12:18:50,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:18:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-27 12:18:50,816 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:18:50,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 12:18:50,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 12:18:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:18:50,820 INFO L87 Difference]: Start difference. First operand 2504 states and 3228 transitions. Second operand 8 states. [2018-10-27 12:18:51,259 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 12:18:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:18:56,221 INFO L93 Difference]: Finished difference Result 8893 states and 12572 transitions. [2018-10-27 12:18:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 12:18:56,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-10-27 12:18:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:18:56,247 INFO L225 Difference]: With dead ends: 8893 [2018-10-27 12:18:56,247 INFO L226 Difference]: Without dead ends: 4831 [2018-10-27 12:18:56,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-27 12:18:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2018-10-27 12:18:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4670. [2018-10-27 12:18:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2018-10-27 12:18:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 5619 transitions. [2018-10-27 12:18:56,396 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 5619 transitions. Word has length 179 [2018-10-27 12:18:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:18:56,397 INFO L481 AbstractCegarLoop]: Abstraction has 4670 states and 5619 transitions. [2018-10-27 12:18:56,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 12:18:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 5619 transitions. [2018-10-27 12:18:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 12:18:56,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:18:56,408 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:18:56,408 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:18:56,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1042057633, now seen corresponding path program 1 times [2018-10-27 12:18:56,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:18:56,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:56,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:18:56,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:18:56,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:18:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:18:56,927 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 12:18:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 12:18:57,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:18:57,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:18:57,022 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-10-27 12:18:57,022 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:18:57,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:18:57,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:18:57,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:18:57,651 INFO L272 AbstractInterpreter]: Visited 117 different actions 184 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:18:57,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:18:57,690 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:18:58,607 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 81.08% of their original sizes. [2018-10-27 12:18:58,607 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:19:01,374 INFO L415 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2018-10-27 12:19:01,375 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:19:01,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:19:01,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [6] total 31 [2018-10-27 12:19:01,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:19:01,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 12:19:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 12:19:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:19:01,382 INFO L87 Difference]: Start difference. First operand 4670 states and 5619 transitions. Second operand 27 states. [2018-10-27 12:19:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:18,782 INFO L93 Difference]: Finished difference Result 9616 states and 11575 transitions. [2018-10-27 12:19:18,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 12:19:18,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 180 [2018-10-27 12:19:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:18,804 INFO L225 Difference]: With dead ends: 9616 [2018-10-27 12:19:18,804 INFO L226 Difference]: Without dead ends: 5226 [2018-10-27 12:19:18,821 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=439, Invalid=1453, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 12:19:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2018-10-27 12:19:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 5081. [2018-10-27 12:19:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2018-10-27 12:19:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 6054 transitions. [2018-10-27 12:19:18,946 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 6054 transitions. Word has length 180 [2018-10-27 12:19:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:18,947 INFO L481 AbstractCegarLoop]: Abstraction has 5081 states and 6054 transitions. [2018-10-27 12:19:18,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 12:19:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 6054 transitions. [2018-10-27 12:19:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-27 12:19:18,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:19:18,960 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:19:18,960 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:19:18,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash 660025092, now seen corresponding path program 1 times [2018-10-27 12:19:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:19:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:18,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:18,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:19:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 12:19:19,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:19,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:19:19,467 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-10-27 12:19:19,468 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:19:19,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:19:19,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:19:20,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:19:20,104 INFO L272 AbstractInterpreter]: Visited 119 different actions 431 times. Merged at 9 different actions 35 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:19:20,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:20,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:19:20,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:20,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:19:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:20,124 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:19:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:20,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:19:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-27 12:19:20,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:19:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 12:19:20,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:19:20,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 12:19:20,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:19:20,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:19:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:19:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 12:19:20,855 INFO L87 Difference]: Start difference. First operand 5081 states and 6054 transitions. Second operand 11 states. [2018-10-27 12:19:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:22,953 INFO L93 Difference]: Finished difference Result 10840 states and 13098 transitions. [2018-10-27 12:19:22,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 12:19:22,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-10-27 12:19:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:22,979 INFO L225 Difference]: With dead ends: 10840 [2018-10-27 12:19:22,979 INFO L226 Difference]: Without dead ends: 6312 [2018-10-27 12:19:22,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:19:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2018-10-27 12:19:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 6159. [2018-10-27 12:19:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6159 states. [2018-10-27 12:19:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6159 states to 6159 states and 7260 transitions. [2018-10-27 12:19:23,154 INFO L78 Accepts]: Start accepts. Automaton has 6159 states and 7260 transitions. Word has length 189 [2018-10-27 12:19:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:23,154 INFO L481 AbstractCegarLoop]: Abstraction has 6159 states and 7260 transitions. [2018-10-27 12:19:23,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:19:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6159 states and 7260 transitions. [2018-10-27 12:19:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-27 12:19:23,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:19:23,169 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:19:23,170 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:19:23,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:19:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1418630858, now seen corresponding path program 2 times [2018-10-27 12:19:23,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:19:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:23,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:19:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:19:23,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:19:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:19:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 12:19:24,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:24,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:19:24,091 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 12:19:24,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 12:19:24,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:19:24,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-27 12:19:24,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 12:19:24,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 12:19:24,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 12:19:24,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 12:19:24,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:19:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-27 12:19:24,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:19:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-27 12:19:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:19:24,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-27 12:19:24,486 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:19:24,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:19:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:19:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:19:24,487 INFO L87 Difference]: Start difference. First operand 6159 states and 7260 transitions. Second operand 3 states. [2018-10-27 12:19:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:19:25,355 INFO L93 Difference]: Finished difference Result 9678 states and 11446 transitions. [2018-10-27 12:19:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:19:25,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-27 12:19:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:19:25,356 INFO L225 Difference]: With dead ends: 9678 [2018-10-27 12:19:25,356 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:19:25,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:19:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:19:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:19:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:19:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:19:25,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2018-10-27 12:19:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:19:25,374 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:19:25,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:19:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:19:25,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:19:25,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:19:25,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:25,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:25,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:25,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:25,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:25,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:25,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,123 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 197 [2018-10-27 12:19:26,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:19:26,465 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 187 [2018-10-27 12:19:27,596 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-27 12:19:28,097 WARN L179 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2018-10-27 12:19:33,497 WARN L179 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 322 DAG size of output: 129 [2018-10-27 12:19:34,325 WARN L179 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 99 [2018-10-27 12:19:36,038 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 217 DAG size of output: 99 [2018-10-27 12:19:36,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:19:36,042 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-10-27 12:19:36,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,043 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,044 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 12:19:36,045 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,046 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,047 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 12:19:36,048 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,049 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,050 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 12:19:36,051 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 12:19:36,052 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,053 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 12:19:36,054 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 12:19:36,055 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 12:19:36,055 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse23 (= 1 ~a7~0)) (.cse22 (not (= ~a16~0 6))) (.cse28 (<= ~a16~0 5)) (.cse29 (= ~a17~0 1)) (.cse18 (= ~a21~0 1)) (.cse27 (<= 4 ~a16~0)) (.cse31 (= ~a7~0 |old(~a7~0)|)) (.cse24 (= |old(~a8~0)| ~a8~0)) (.cse26 (= |old(~a20~0)| ~a20~0))) (let ((.cse17 (not (= 15 |old(~a8~0)|))) (.cse19 (and .cse31 .cse24 .cse26)) (.cse15 (< |old(~a7~0)| 0)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse1 (not (= 1 |old(~a21~0)|))) (.cse8 (< 15 |old(~a8~0)|)) (.cse2 (= 13 |old(~a8~0)|)) (.cse3 (not (= 8 ~a12~0))) (.cse9 (and .cse28 .cse29 .cse18 .cse27)) (.cse10 (< |old(~a20~0)| 0)) (.cse4 (not (= 1 |old(~a17~0)|))) (.cse11 (< 5 |old(~a16~0)|)) (.cse12 (< |old(~a16~0)| 4)) (.cse13 (< |old(~a8~0)| 13)) (.cse7 (< |calculate_output_#in~input| 1)) (.cse25 (< |old(~a8~0)| 15)) (.cse30 (and .cse23 .cse24 .cse26 .cse22)) (.cse6 (not (= 1 |old(~a7~0)|))) (.cse14 (< 0 |old(~a7~0)|)) (.cse16 (< 0 |old(~a20~0)|)) (.cse32 (= 1 ~a20~0)) (.cse21 (= 6 |old(~a16~0)|)) (.cse20 (< 13 |old(~a8~0)|)) (.cse5 (not (= 1 |old(~a20~0)|)))) (and (or .cse0 (or .cse1 (not (= 4 |old(~a16~0)|)) (not .cse2)) .cse3 .cse4 .cse5 (= ~a16~0 4) .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7) (or (or .cse0 .cse1 .cse3 .cse10 .cse4 .cse17 (not (= 5 |old(~a16~0)|)) .cse15 .cse7) .cse14 (= ~a16~0 5) .cse16) (or (or (not (= 0 |old(~a7~0)|)) .cse1 .cse3 (< 1 |old(~a17~0)|) (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse5 .cse17 (< |old(~a17~0)| 0)) (and (<= 0 ~a17~0) (<= 5 ~a16~0) .cse18 (<= ~a17~0 1) (<= ~a16~0 6))) (or .cse2 .cse14 .cse19 .cse16) (or .cse19 .cse5 .cse14) (or .cse0 .cse1 .cse20 .cse9 .cse3 .cse4 .cse5 .cse11 .cse12 (< 1 |old(~a7~0)|) .cse13 .cse15 .cse7) (or .cse21 .cse5 .cse22 .cse14) (or .cse21 (and .cse23 .cse24 .cse22) .cse6 .cse25) (or .cse21 .cse14 .cse26 .cse16) (or .cse0 .cse1 .cse8 .cse3 (and .cse18 .cse27 .cse28 .cse29) .cse4 .cse5 .cse11 .cse12 .cse13 .cse14 .cse15 .cse7) (or .cse21 .cse5 .cse6 .cse30) (or .cse21 (= |old(~a7~0)| 1) .cse20 (and .cse31 .cse24 .cse22)) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse9 (< 1 |old(~a20~0)|) .cse10 .cse4 .cse11 .cse12 .cse6 .cse13 .cse7) (or .cse5 (and .cse23 .cse24 .cse32) .cse6 .cse25) (or .cse30 .cse21 .cse6 .cse16) (or .cse20 .cse5 (and .cse23 .cse24 .cse26) .cse6) (or .cse21 .cse14 .cse16 .cse22) (or .cse32 .cse21 .cse20 .cse5)))) [2018-10-27 12:19:36,055 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 12:19:36,055 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 12:19:36,056 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 12:19:36,057 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 12:19:36,058 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 12:19:36,059 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,060 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 12:19:36,061 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 12:19:36,062 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 12:19:36,062 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:19:36,062 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-27 12:19:36,062 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:19:36,062 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:19:36,062 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~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-10-27 12:19:36,062 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:19:36,063 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 |old(~a8~0)|)) (.cse4 (<= 15 ~a8~0)) (.cse7 (<= ~a8~0 13)) (.cse0 (<= ~a20~0 0)) (.cse1 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse6 (= 1 ~a20~0)) (.cse5 (not (= ~a16~0 6)))) (or (and (not (= ~a8~0 13)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3 .cse4 .cse6) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse3 .cse6) (and .cse6 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse5 .cse0) (and .cse5 .cse0 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse3 .cse6 .cse5) (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)))) [2018-10-27 12:19:36,063 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 12:19:36,063 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 12:19:36,063 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 12:19:36,063 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 |old(~a8~0)|)) (.cse4 (<= 15 ~a8~0)) (.cse7 (<= ~a8~0 13)) (.cse0 (<= ~a20~0 0)) (.cse1 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse6 (= 1 ~a20~0)) (.cse5 (not (= ~a16~0 6)))) (or (and (not (= ~a8~0 13)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3 .cse4 .cse6) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse3 .cse6) (and .cse6 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse5 .cse0) (and .cse5 .cse0 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse3 .cse6 .cse5) (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)))) [2018-10-27 12:19:36,064 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:19:36,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:19:36 BoogieIcfgContainer [2018-10-27 12:19:36,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:19:36,080 INFO L168 Benchmark]: Toolchain (without parser) took 99965.64 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-27 12:19:36,081 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:19:36,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:19:36,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 220.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 12:19:36,083 INFO L168 Benchmark]: Boogie Preprocessor took 107.11 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:19:36,083 INFO L168 Benchmark]: RCFGBuilder took 3586.73 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: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB. [2018-10-27 12:19:36,084 INFO L168 Benchmark]: TraceAbstraction took 95387.80 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -683.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-27 12:19:36,089 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 658.53 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 220.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.11 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3586.73 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: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95387.80 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -683.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 491]: 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) && a20 <= 0) && a7 <= 0) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && !(a16 == 6))) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && 1 == a20)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((a8 <= 13 && 1 == a7) && 1 == a20)) || (1 == a20 && a7 <= 0)) || !(z == 26)) || !(\old(a16) == 5)) || ((1 == a7 && !(a16 == 6)) && a20 <= 0)) || ((!(a16 == 6) && a20 <= 0) && a7 <= 0)) || !(0 == \old(a7))) || ((1 == a7 && 1 == a20) && !(a16 == 6))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 95.2s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 64.9s AutomataDifference, 0.0s DeadEndRemovalTime, 10.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1314 SDtfs, 10515 SDslu, 1477 SDs, 0 SdLazy, 12430 SolverSat, 2161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1869 GetRequests, 1694 SyntacticMatches, 7 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6159occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9964271340555051 AbsIntWeakeningRatio, 0.2662337662337662 AbsIntAvgWeakeningVarsNumRemoved, 21.680194805194805 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 800 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 196 PreInvPairs, 312 NumberOfFragments, 1166 HoareAnnotationTreeSize, 196 FomulaSimplifications, 13394 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8677 FormulaSimplificationTreeSizeReductionInter, 9.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2100 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2641 ConstructedInterpolants, 0 QuantifiedInterpolants, 846854 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1566 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 1373/1535 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...