java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:47:38,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:47:38,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:47:38,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:47:38,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:47:38,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:47:38,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:47:38,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:47:38,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:47:38,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:47:38,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:47:38,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:47:38,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:47:38,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:47:38,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:47:38,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:47:38,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:47:38,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:47:38,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:47:38,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:47:38,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:47:38,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:47:38,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:47:38,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:47:38,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:47:38,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:47:38,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:47:38,204 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:47:38,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:47:38,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:47:38,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:47:38,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:47:38,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:47:38,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:47:38,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:47:38,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:47:38,209 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:47:38,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:47:38,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:47:38,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:47:38,230 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:47:38,230 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:47:38,230 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:47:38,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:47:38,230 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:47:38,231 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:47:38,231 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:47:38,231 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:47:38,231 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:47:38,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:47:38,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:47:38,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:47:38,233 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:47:38,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:47:38,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:47:38,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:47:38,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:47:38,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:47:38,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:47:38,234 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:47:38,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:47:38,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:47:38,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:47:38,235 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:47:38,235 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:47:38,235 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:47:38,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:47:38,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:47:38,236 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:47:38,236 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:47:38,236 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:47:38,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:47:38,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:47:38,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:47:38,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:47:38,325 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:47:38,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label17_true-unreach-call_false-termination.c [2018-11-07 12:47:38,397 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8b53e5ca/cdb82fba3b4940429a4c76d2c1695fcd/FLAGf225d0ebc [2018-11-07 12:47:38,999 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:47:39,000 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label17_true-unreach-call_false-termination.c [2018-11-07 12:47:39,025 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8b53e5ca/cdb82fba3b4940429a4c76d2c1695fcd/FLAGf225d0ebc [2018-11-07 12:47:39,041 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8b53e5ca/cdb82fba3b4940429a4c76d2c1695fcd [2018-11-07 12:47:39,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:47:39,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:47:39,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:47:39,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:47:39,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:47:39,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1b1032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39, skipping insertion in model container [2018-11-07 12:47:39,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:47:39,150 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:47:39,652 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:47:39,658 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:47:39,808 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:47:39,827 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:47:39,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39 WrapperNode [2018-11-07 12:47:39,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:47:39,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:47:39,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:47:39,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:47:39,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:47:39,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:47:39,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:47:39,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:47:39,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:39,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:40,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:40,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:40,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... [2018-11-07 12:47:40,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:47:40,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:47:40,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:47:40,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:47:40,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:47:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:47:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:47:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:47:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:47:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:47:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:47:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:47:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:47:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:47:43,287 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:47:43,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:47:43 BoogieIcfgContainer [2018-11-07 12:47:43,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:47:43,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:47:43,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:47:43,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:47:43,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:47:39" (1/3) ... [2018-11-07 12:47:43,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c1c4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:47:43, skipping insertion in model container [2018-11-07 12:47:43,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:39" (2/3) ... [2018-11-07 12:47:43,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c1c4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:47:43, skipping insertion in model container [2018-11-07 12:47:43,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:47:43" (3/3) ... [2018-11-07 12:47:43,305 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label17_true-unreach-call_false-termination.c [2018-11-07 12:47:43,316 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:47:43,328 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:47:43,347 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:47:43,396 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:47:43,396 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:47:43,396 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:47:43,397 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:47:43,397 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:47:43,397 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:47:43,397 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:47:43,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:47:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:47:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 12:47:43,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:43,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:43,454 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:43,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1707442147, now seen corresponding path program 1 times [2018-11-07 12:47:43,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:43,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:43,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:44,118 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:47:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:47:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:47:44,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:47:44,292 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:44,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:47:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:47:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:47:44,320 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:47:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:45,723 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:47:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:47:45,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-11-07 12:47:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:45,745 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:47:45,745 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:47:45,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:47:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:47:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:47:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:47:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-11-07 12:47:45,834 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 123 [2018-11-07 12:47:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:45,835 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-11-07 12:47:45,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:47:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-11-07 12:47:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 12:47:45,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:45,844 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:45,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:45,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash -568294122, now seen corresponding path program 1 times [2018-11-07 12:47:45,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:45,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:45,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:45,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:45,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:47:46,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:47:46,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:47:46,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:46,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:47:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:47:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:47:46,110 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 3 states. [2018-11-07 12:47:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:47,109 INFO L93 Difference]: Finished difference Result 946 states and 1654 transitions. [2018-11-07 12:47:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:47:47,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-11-07 12:47:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:47,117 INFO L225 Difference]: With dead ends: 946 [2018-11-07 12:47:47,117 INFO L226 Difference]: Without dead ends: 612 [2018-11-07 12:47:47,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:47:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-07 12:47:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-11-07 12:47:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-07 12:47:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 987 transitions. [2018-11-07 12:47:47,169 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 987 transitions. Word has length 141 [2018-11-07 12:47:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:47,170 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 987 transitions. [2018-11-07 12:47:47,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:47:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 987 transitions. [2018-11-07 12:47:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 12:47:47,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:47,177 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:47,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:47,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1913137078, now seen corresponding path program 1 times [2018-11-07 12:47:47,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:47,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:47,453 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:47:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:47:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:47:47,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:47:47,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:47,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:47:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:47:47,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:47:47,598 INFO L87 Difference]: Start difference. First operand 612 states and 987 transitions. Second operand 6 states. [2018-11-07 12:47:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:49,531 INFO L93 Difference]: Finished difference Result 1625 states and 2647 transitions. [2018-11-07 12:47:49,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:47:49,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-11-07 12:47:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:49,544 INFO L225 Difference]: With dead ends: 1625 [2018-11-07 12:47:49,544 INFO L226 Difference]: Without dead ends: 1019 [2018-11-07 12:47:49,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:47:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-11-07 12:47:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1009. [2018-11-07 12:47:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-11-07 12:47:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1456 transitions. [2018-11-07 12:47:49,599 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1456 transitions. Word has length 167 [2018-11-07 12:47:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:49,600 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1456 transitions. [2018-11-07 12:47:49,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:47:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1456 transitions. [2018-11-07 12:47:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 12:47:49,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:49,606 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:47:49,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:49,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1620857015, now seen corresponding path program 1 times [2018-11-07 12:47:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:49,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:47:49,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:49,846 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:49,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-07 12:47:49,849 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:47:49,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:49,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:56,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:47:56,799 INFO L272 AbstractInterpreter]: Visited 127 different actions 192 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:47:56,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:56,845 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:59,808 INFO L227 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 80.45% of their original sizes. [2018-11-07 12:47:59,808 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:48:00,253 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-11-07 12:48:00,253 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:48:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:48:00,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:48:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:48:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:48:00,257 INFO L87 Difference]: Start difference. First operand 1009 states and 1456 transitions. Second operand 11 states. [2018-11-07 12:48:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:19,849 INFO L93 Difference]: Finished difference Result 3048 states and 4348 transitions. [2018-11-07 12:48:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:48:19,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2018-11-07 12:48:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:19,861 INFO L225 Difference]: With dead ends: 3048 [2018-11-07 12:48:19,862 INFO L226 Difference]: Without dead ends: 2045 [2018-11-07 12:48:19,867 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:48:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2018-11-07 12:48:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1992. [2018-11-07 12:48:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2018-11-07 12:48:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2536 transitions. [2018-11-07 12:48:19,934 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2536 transitions. Word has length 179 [2018-11-07 12:48:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:19,935 INFO L480 AbstractCegarLoop]: Abstraction has 1992 states and 2536 transitions. [2018-11-07 12:48:19,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:48:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2536 transitions. [2018-11-07 12:48:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-07 12:48:19,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:19,944 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:48:19,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:19,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash -754119044, now seen corresponding path program 1 times [2018-11-07 12:48:19,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:19,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:19,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:20,462 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:48:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:48:20,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:20,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:20,524 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-07 12:48:20,525 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:20,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:20,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:22,712 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:48:22,712 INFO L272 AbstractInterpreter]: Visited 128 different actions 195 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:48:22,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:22,717 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:48:24,482 INFO L227 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 81.11% of their original sizes. [2018-11-07 12:48:24,482 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:48:25,213 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-07 12:48:25,214 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:48:25,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:48:25,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 12:48:25,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:25,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 12:48:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 12:48:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:48:25,216 INFO L87 Difference]: Start difference. First operand 1992 states and 2536 transitions. Second operand 19 states. [2018-11-07 12:48:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:48,171 INFO L93 Difference]: Finished difference Result 4263 states and 5497 transitions. [2018-11-07 12:48:48,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:48:48,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 192 [2018-11-07 12:48:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:48,183 INFO L225 Difference]: With dead ends: 4263 [2018-11-07 12:48:48,183 INFO L226 Difference]: Without dead ends: 2413 [2018-11-07 12:48:48,189 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:48:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2018-11-07 12:48:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2403. [2018-11-07 12:48:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2018-11-07 12:48:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 2986 transitions. [2018-11-07 12:48:48,254 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 2986 transitions. Word has length 192 [2018-11-07 12:48:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:48,256 INFO L480 AbstractCegarLoop]: Abstraction has 2403 states and 2986 transitions. [2018-11-07 12:48:48,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 12:48:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2986 transitions. [2018-11-07 12:48:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-07 12:48:48,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:48,266 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:48,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:48,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 694680239, now seen corresponding path program 1 times [2018-11-07 12:48:48,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:48,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:48,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 86 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:48:48,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:48,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:48,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-07 12:48:48,480 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [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], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:48,484 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:48,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:52,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:48:52,244 INFO L272 AbstractInterpreter]: Visited 130 different actions 331 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:48:52,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:52,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:48:52,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:52,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:48:52,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:52,269 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:48:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:52,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:48:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-07 12:48:52,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:48:52,945 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:48:53,048 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:48:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 86 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:48:53,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:48:53,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:48:53,563 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:48:53,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:48:53,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:48:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:48:53,565 INFO L87 Difference]: Start difference. First operand 2403 states and 2986 transitions. Second operand 8 states. [2018-11-07 12:48:53,930 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 12:48:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:58,972 INFO L93 Difference]: Finished difference Result 7140 states and 9681 transitions. [2018-11-07 12:48:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:48:58,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 204 [2018-11-07 12:48:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:58,993 INFO L225 Difference]: With dead ends: 7140 [2018-11-07 12:48:58,993 INFO L226 Difference]: Without dead ends: 3669 [2018-11-07 12:48:59,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:48:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2018-11-07 12:48:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3577. [2018-11-07 12:48:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2018-11-07 12:48:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4258 transitions. [2018-11-07 12:48:59,114 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4258 transitions. Word has length 204 [2018-11-07 12:48:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:59,115 INFO L480 AbstractCegarLoop]: Abstraction has 3577 states and 4258 transitions. [2018-11-07 12:48:59,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:48:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4258 transitions. [2018-11-07 12:48:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 12:48:59,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:59,129 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:48:59,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:59,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1037869160, now seen corresponding path program 1 times [2018-11-07 12:48:59,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:59,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:59,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:59,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:59,660 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:48:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:48:59,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:59,759 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:59,759 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-11-07 12:48:59,759 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:48:59,770 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:59,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:04,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:04,032 INFO L272 AbstractInterpreter]: Visited 128 different actions 195 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:49:04,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:04,070 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:07,200 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 80.74% of their original sizes. [2018-11-07 12:49:07,200 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:08,044 INFO L415 sIntCurrentIteration]: We unified 224 AI predicates to 224 [2018-11-07 12:49:08,044 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:08,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:08,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 12:49:08,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:08,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 12:49:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 12:49:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:49:08,047 INFO L87 Difference]: Start difference. First operand 3577 states and 4258 transitions. Second operand 23 states. [2018-11-07 12:49:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:27,336 INFO L93 Difference]: Finished difference Result 6883 states and 8265 transitions. [2018-11-07 12:49:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:49:27,336 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 225 [2018-11-07 12:49:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:27,353 INFO L225 Difference]: With dead ends: 6883 [2018-11-07 12:49:27,353 INFO L226 Difference]: Without dead ends: 3859 [2018-11-07 12:49:27,364 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 194 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:49:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2018-11-07 12:49:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 3853. [2018-11-07 12:49:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2018-11-07 12:49:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4554 transitions. [2018-11-07 12:49:27,459 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4554 transitions. Word has length 225 [2018-11-07 12:49:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:27,460 INFO L480 AbstractCegarLoop]: Abstraction has 3853 states and 4554 transitions. [2018-11-07 12:49:27,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 12:49:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4554 transitions. [2018-11-07 12:49:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-07 12:49:27,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:27,475 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:27,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:27,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:27,476 INFO L82 PathProgramCache]: Analyzing trace with hash -765075483, now seen corresponding path program 1 times [2018-11-07 12:49:27,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:27,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:27,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:27,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:27,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:49:28,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:28,157 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:28,158 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-07 12:49:28,158 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:28,160 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:28,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:34,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:49:34,891 INFO L272 AbstractInterpreter]: Visited 130 different actions 724 times. Merged at 9 different actions 59 times. Widened at 1 different actions 2 times. Found 14 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:34,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:34,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:49:34,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:34,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:49:34,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:34,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:49:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:35,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-07 12:49:35,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 116 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:49:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:49:35,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:49:35,343 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:49:35,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:49:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:49:35,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:49:35,345 INFO L87 Difference]: Start difference. First operand 3853 states and 4554 transitions. Second operand 11 states. [2018-11-07 12:49:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:37,356 INFO L93 Difference]: Finished difference Result 8197 states and 9799 transitions. [2018-11-07 12:49:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:49:37,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2018-11-07 12:49:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:37,378 INFO L225 Difference]: With dead ends: 8197 [2018-11-07 12:49:37,378 INFO L226 Difference]: Without dead ends: 4897 [2018-11-07 12:49:37,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:49:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2018-11-07 12:49:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 4748. [2018-11-07 12:49:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2018-11-07 12:49:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 5525 transitions. [2018-11-07 12:49:37,509 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 5525 transitions. Word has length 234 [2018-11-07 12:49:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:37,509 INFO L480 AbstractCegarLoop]: Abstraction has 4748 states and 5525 transitions. [2018-11-07 12:49:37,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:49:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 5525 transitions. [2018-11-07 12:49:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-07 12:49:37,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:37,528 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:37,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:37,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2147192563, now seen corresponding path program 2 times [2018-11-07 12:49:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:37,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 64 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 12:49:37,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:37,854 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:37,854 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 12:49:37,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 12:49:37,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:37,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:49:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 12:49:38,018 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 12:49:38,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 12:49:38,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 12:49:38,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:49:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 12:49:38,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:49:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 12:49:38,440 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:38,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:49:38,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:49:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:49:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:49:38,442 INFO L87 Difference]: Start difference. First operand 4748 states and 5525 transitions. Second operand 3 states. [2018-11-07 12:49:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:39,557 INFO L93 Difference]: Finished difference Result 11543 states and 13692 transitions. [2018-11-07 12:49:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:49:39,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-11-07 12:49:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:39,566 INFO L225 Difference]: With dead ends: 11543 [2018-11-07 12:49:39,566 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:49:39,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:49:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:49:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:49:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:49:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:49:39,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2018-11-07 12:49:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:39,596 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:49:39,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:49:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:49:39,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:49:39,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:49:39,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:39,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,089 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 197 [2018-11-07 12:49:40,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:49:40,293 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 185 [2018-11-07 12:49:41,303 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-07 12:49:41,866 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 86 [2018-11-07 12:49:46,889 WARN L179 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 335 DAG size of output: 173 [2018-11-07 12:49:47,638 WARN L179 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 105 [2018-11-07 12:49:48,251 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 108 [2018-11-07 12:49:48,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:49:48,254 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-11-07 12:49:48,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:49:48,254 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,255 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:49:48,256 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,258 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:49:48,259 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:49:48,260 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:49:48,261 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:49:48,261 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,261 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,261 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:49:48,262 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:49:48,263 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:49:48,264 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:49:48,265 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,266 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,267 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,268 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,268 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,268 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:49:48,269 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 524) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,270 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:49:48,271 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:49:48,272 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:49:48,273 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:49:48,273 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:49:48,273 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:49:48,273 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:49:48,273 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse15 (= |old(~a20~0)| ~a20~0)) (.cse13 (= ~a7~0 |old(~a7~0)|)) (.cse14 (= |old(~a8~0)| ~a8~0))) (let ((.cse19 (and .cse13 .cse14)) (.cse18 (and .cse13 .cse14 .cse15 (<= ~a17~0 0))) (.cse2 (= ~a16~0 5)) (.cse11 (not (= 1 |old(~a7~0)|))) (.cse21 (and (= 1 ~a7~0) .cse14)) (.cse16 (< |old(~a8~0)| 15)) (.cse20 (< 13 |old(~a8~0)|)) (.cse8 (< 0 |old(~a20~0)|)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse6 (not (= 1 |old(~a17~0)|))) (.cse0 (= ~a17~0 1)) (.cse12 (< |calculate_output_#in~input| 1)) (.cse3 (not (= 0 |old(~a7~0)|))) (.cse4 (not (= 1 |old(~a21~0)|))) (.cse5 (not (= 8 ~a12~0))) (.cse17 (< 0 |old(~a17~0)|)) (.cse10 (not (= 1 |old(~a20~0)|))) (.cse7 (not (= 15 |old(~a8~0)|))) (.cse1 (= ~a21~0 1))) (and (or (and .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 (< |old(~a20~0)| 0) .cse6 .cse7 (not (= 5 |old(~a16~0)|)) .cse8)) (or .cse9 (or .cse4 (not (= 4 |old(~a16~0)|)) (not (= 13 |old(~a8~0)|))) .cse5 (= ~a16~0 4) .cse6 .cse10 .cse11 .cse12) (or (and .cse13 .cse14 .cse15) .cse16 .cse8) (or .cse10 .cse17 .cse18) (or .cse10 .cse15 .cse16) (or .cse10 .cse19 .cse16) (or (= |old(~a7~0)| 1) .cse20 .cse19) (or .cse20 .cse10 (= 1 ~a20~0)) (or .cse20 .cse21 .cse11 .cse8) (or .cse18 .cse17 .cse8) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse12 .cse3 .cse9 (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)) .cse2 (not (= 6 ~f~0))) (or .cse20 .cse10 .cse11 .cse21) (or .cse11 .cse21 .cse16) (or .cse20 .cse15 .cse8) (or .cse9 .cse4 (< 15 |old(~a8~0)|) .cse5 .cse6 (and (<= ~a16~0 5) .cse0 .cse1 .cse13 .cse14 (<= 4 ~a16~0) (= ~a20~0 1)) .cse10 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) (< 1 |old(~a7~0)|) (< |old(~a8~0)| 13) (< |old(~a7~0)| 0) .cse12) (or .cse3 .cse4 .cse5 .cse17 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse10 .cse7 (< |old(~a17~0)| 0) (and (<= 0 ~a17~0) (<= 5 ~a16~0) .cse1 (<= ~a16~0 6)))))) [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,274 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:49:48,275 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:49:48,276 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:49:48,277 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:49:48,277 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:49:48,277 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:49:48,278 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:49:48,279 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:49:48,279 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,279 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:49:48,280 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:49:48,281 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:49:48,281 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:49:48,281 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:49:48,281 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:49:48,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:49:48,281 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-11-07 12:49:48,281 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:49:48,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:49:48,282 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (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)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:49:48,282 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:49:48,282 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (= 1 ~a20~0)) (.cse0 (not (= ~a8~0 14))) (.cse3 (<= ~a17~0 0)) (.cse1 (<= ~a20~0 0))) (or (and .cse0 .cse1) (and (<= ~a7~0 1) (<= 1 main_~input~0) (<= main_~input~0 6) (<= ~a16~0 5) (= ~a17~0 1) (= ~a21~0 1) (<= 0 ~a7~0) (<= 4 ~a16~0) (= ~a20~0 1)) (and .cse2 .cse3) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (<= ~a8~0 13) (= ~a7~0 |old(~a7~0)|)) (and (<= ~a8~0 |old(~a8~0)|) (= 1 ~a7~0) (<= 15 ~a8~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and .cse2 .cse0) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse3 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (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-11-07 12:49:48,282 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:49:48,282 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:49:48,282 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:49:48,283 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (= 1 ~a20~0)) (.cse0 (not (= ~a8~0 14))) (.cse3 (<= ~a17~0 0)) (.cse1 (<= ~a20~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (<= ~a8~0 13) (= ~a7~0 |old(~a7~0)|)) (and (<= ~a7~0 1) (<= ~a16~0 5) (= ~a17~0 1) (= ~a21~0 1) (<= 0 ~a7~0) (<= 4 ~a16~0) (= ~a20~0 1)) (and (<= ~a8~0 |old(~a8~0)|) (= 1 ~a7~0) (<= 15 ~a8~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and .cse2 .cse0) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse3 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (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-11-07 12:49:48,283 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:49:48,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:49:48 BoogieIcfgContainer [2018-11-07 12:49:48,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:49:48,307 INFO L168 Benchmark]: Toolchain (without parser) took 129253.54 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -946.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-07 12:49:48,308 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:49:48,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.52 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:48,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:49:48,310 INFO L168 Benchmark]: Boogie Preprocessor took 101.00 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:49:48,311 INFO L168 Benchmark]: RCFGBuilder took 3220.46 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-11-07 12:49:48,312 INFO L168 Benchmark]: TraceAbstraction took 125010.39 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -267.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 12:49:48,316 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.23 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 772.52 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 143.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.00 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 3220.46 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 125010.39 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -267.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 524]: 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 == 14) && a20 <= 0) || (1 == a20 && a17 <= 0)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (a8 <= 13 && a7 == \old(a7))) || ((((((a7 <= 1 && a16 <= 5) && a17 == 1) && a21 == 1) && 0 <= a7) && 4 <= a16) && a20 == 1)) || ((a8 <= \old(a8) && 1 == a7) && 15 <= a8)) || !(x == 24)) || !(a12 == 8)) || (1 == a20 && !(a8 == 14))) || !(e == 5)) || !(d == 4)) || (a17 <= 0 && a20 <= 0)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(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, 124.9s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 74.9s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1348 SDtfs, 8931 SDslu, 1590 SDs, 0 SdLazy, 11277 SolverSat, 1894 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2060 GetRequests, 1903 SyntacticMatches, 16 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4748occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 24.0s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9974640697209531 AbsIntWeakeningRatio, 0.1973018549747049 AbsIntAvgWeakeningVarsNumRemoved, 22.566610455311974 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 320 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 184 PreInvPairs, 318 NumberOfFragments, 944 HoareAnnotationTreeSize, 184 FomulaSimplifications, 7886 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 7762 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2371 NumberOfCodeBlocks, 2304 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3028 ConstructedInterpolants, 0 QuantifiedInterpolants, 1205214 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1643 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1743/1987 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...