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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 08:24:10,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 08:24:10,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 08:24:10,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 08:24:10,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 08:24:10,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 08:24:10,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 08:24:10,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 08:24:10,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 08:24:10,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 08:24:10,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 08:24:10,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 08:24:10,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 08:24:10,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 08:24:10,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 08:24:10,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 08:24:10,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 08:24:10,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 08:24:10,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 08:24:10,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 08:24:10,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 08:24:10,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 08:24:10,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 08:24:10,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 08:24:10,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 08:24:10,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 08:24:10,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 08:24:10,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 08:24:10,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 08:24:10,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 08:24:10,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 08:24:10,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 08:24:10,260 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 08:24:10,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 08:24:10,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 08:24:10,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 08:24:10,264 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 08:24:10,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 08:24:10,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 08:24:10,282 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 08:24:10,282 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 08:24:10,282 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 08:24:10,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 08:24:10,283 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 08:24:10,283 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 08:24:10,283 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 08:24:10,283 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 08:24:10,283 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 08:24:10,284 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 08:24:10,284 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 08:24:10,284 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 08:24:10,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 08:24:10,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 08:24:10,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 08:24:10,285 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 08:24:10,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 08:24:10,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 08:24:10,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 08:24:10,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 08:24:10,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 08:24:10,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 08:24:10,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 08:24:10,287 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 08:24:10,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 08:24:10,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 08:24:10,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 08:24:10,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 08:24:10,288 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 08:24:10,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 08:24:10,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 08:24:10,288 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 08:24:10,289 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 08:24:10,289 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 08:24:10,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 08:24:10,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 08:24:10,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 08:24:10,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 08:24:10,380 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 08:24:10,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-11-07 08:24:10,448 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df8279c0/c530722f547c44518aeed5fa9ce14f4e/FLAGa52fb94dd [2018-11-07 08:24:11,085 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 08:24:11,086 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-11-07 08:24:11,113 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df8279c0/c530722f547c44518aeed5fa9ce14f4e/FLAGa52fb94dd [2018-11-07 08:24:11,136 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df8279c0/c530722f547c44518aeed5fa9ce14f4e [2018-11-07 08:24:11,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 08:24:11,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 08:24:11,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 08:24:11,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 08:24:11,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 08:24:11,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:11,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567b4d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11, skipping insertion in model container [2018-11-07 08:24:11,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:11,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 08:24:11,244 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 08:24:11,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 08:24:11,733 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 08:24:11,863 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 08:24:11,887 INFO L193 MainTranslator]: Completed translation [2018-11-07 08:24:11,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11 WrapperNode [2018-11-07 08:24:11,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 08:24:11,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 08:24:11,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 08:24:11,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 08:24:11,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 08:24:12,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 08:24:12,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 08:24:12,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 08:24:12,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (1/1) ... [2018-11-07 08:24:12,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 08:24:12,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 08:24:12,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 08:24:12,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 08:24:12,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (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 08:24:12,188 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 08:24:12,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 08:24:12,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 08:24:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 08:24:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 08:24:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 08:24:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 08:24:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 08:24:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 08:24:15,304 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 08:24:15,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:15 BoogieIcfgContainer [2018-11-07 08:24:15,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 08:24:15,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 08:24:15,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 08:24:15,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 08:24:15,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:24:11" (1/3) ... [2018-11-07 08:24:15,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc28a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:15, skipping insertion in model container [2018-11-07 08:24:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:11" (2/3) ... [2018-11-07 08:24:15,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc28a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:15, skipping insertion in model container [2018-11-07 08:24:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:15" (3/3) ... [2018-11-07 08:24:15,313 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label23_true-unreach-call.c [2018-11-07 08:24:15,323 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 08:24:15,333 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 08:24:15,351 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 08:24:15,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 08:24:15,393 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 08:24:15,393 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 08:24:15,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 08:24:15,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 08:24:15,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 08:24:15,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 08:24:15,395 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 08:24:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 08:24:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 08:24:15,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:15,436 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] [2018-11-07 08:24:15,438 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:15,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 508483465, now seen corresponding path program 1 times [2018-11-07 08:24:15,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:15,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:15,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:15,971 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:24:16,028 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 08:24:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:24:16,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 08:24:16,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:24:16,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 08:24:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 08:24:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:24:16,058 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-07 08:24:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:24:17,793 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-07 08:24:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 08:24:17,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-07 08:24:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:24:17,815 INFO L225 Difference]: With dead ends: 574 [2018-11-07 08:24:17,816 INFO L226 Difference]: Without dead ends: 356 [2018-11-07 08:24:17,823 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 08:24:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-07 08:24:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-07 08:24:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 08:24:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-07 08:24:17,905 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 53 [2018-11-07 08:24:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:24:17,906 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-07 08:24:17,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 08:24:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-07 08:24:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 08:24:17,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:17,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:17,915 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:17,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1327667053, now seen corresponding path program 1 times [2018-11-07 08:24:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:17,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:24:18,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 08:24:18,188 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:24:18,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 08:24:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 08:24:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 08:24:18,191 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-07 08:24:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:24:20,828 INFO L93 Difference]: Finished difference Result 1289 states and 2315 transitions. [2018-11-07 08:24:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 08:24:20,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-11-07 08:24:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:24:20,840 INFO L225 Difference]: With dead ends: 1289 [2018-11-07 08:24:20,841 INFO L226 Difference]: Without dead ends: 939 [2018-11-07 08:24:20,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 08:24:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-11-07 08:24:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 926. [2018-11-07 08:24:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-11-07 08:24:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1444 transitions. [2018-11-07 08:24:20,918 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1444 transitions. Word has length 136 [2018-11-07 08:24:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:24:20,918 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1444 transitions. [2018-11-07 08:24:20,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 08:24:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1444 transitions. [2018-11-07 08:24:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 08:24:20,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:20,926 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:20,926 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:20,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -734844493, now seen corresponding path program 1 times [2018-11-07 08:24:20,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:20,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:20,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:20,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:20,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:21,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:24:21,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 08:24:21,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:24:21,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:24:21,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:24:21,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:24:21,274 INFO L87 Difference]: Start difference. First operand 926 states and 1444 transitions. Second operand 6 states. [2018-11-07 08:24:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:24:25,730 INFO L93 Difference]: Finished difference Result 2537 states and 4091 transitions. [2018-11-07 08:24:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 08:24:25,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2018-11-07 08:24:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:24:25,749 INFO L225 Difference]: With dead ends: 2537 [2018-11-07 08:24:25,750 INFO L226 Difference]: Without dead ends: 1617 [2018-11-07 08:24:25,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 08:24:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-11-07 08:24:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1586. [2018-11-07 08:24:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2018-11-07 08:24:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2321 transitions. [2018-11-07 08:24:25,836 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2321 transitions. Word has length 152 [2018-11-07 08:24:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:24:25,836 INFO L480 AbstractCegarLoop]: Abstraction has 1586 states and 2321 transitions. [2018-11-07 08:24:25,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:24:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2321 transitions. [2018-11-07 08:24:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 08:24:25,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:25,845 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:25,845 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:25,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -829584541, now seen corresponding path program 1 times [2018-11-07 08:24:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:25,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:26,228 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:24:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:24:26,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 08:24:26,634 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:24:26,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:24:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:24:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:24:26,637 INFO L87 Difference]: Start difference. First operand 1586 states and 2321 transitions. Second operand 6 states. [2018-11-07 08:24:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:24:27,918 INFO L93 Difference]: Finished difference Result 3508 states and 5326 transitions. [2018-11-07 08:24:27,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 08:24:27,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-11-07 08:24:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:24:27,936 INFO L225 Difference]: With dead ends: 3508 [2018-11-07 08:24:27,937 INFO L226 Difference]: Without dead ends: 1928 [2018-11-07 08:24:27,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 08:24:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-11-07 08:24:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1887. [2018-11-07 08:24:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2018-11-07 08:24:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2679 transitions. [2018-11-07 08:24:28,023 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2679 transitions. Word has length 176 [2018-11-07 08:24:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:24:28,024 INFO L480 AbstractCegarLoop]: Abstraction has 1887 states and 2679 transitions. [2018-11-07 08:24:28,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:24:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2679 transitions. [2018-11-07 08:24:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 08:24:28,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:28,034 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 08:24:28,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:28,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash -642267359, now seen corresponding path program 1 times [2018-11-07 08:24:28,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:28,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:28,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:28,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 161 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:28,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:24:28,438 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:24:28,439 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-07 08:24:28,441 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:24:28,488 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:24:28,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:24:29,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:24:29,584 INFO L272 AbstractInterpreter]: Visited 92 different actions 352 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 08:24:29,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:29,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:24:29,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:24:29,632 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 08:24:29,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:29,647 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:24:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:29,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:24:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 161 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:30,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:24:30,410 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 08:24:30,513 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 08:24:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 161 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:31,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 08:24:31,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 08:24:31,209 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 08:24:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 08:24:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 08:24:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-07 08:24:31,211 INFO L87 Difference]: Start difference. First operand 1887 states and 2679 transitions. Second operand 9 states. [2018-11-07 08:24:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:24:36,514 INFO L93 Difference]: Finished difference Result 5487 states and 8964 transitions. [2018-11-07 08:24:36,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 08:24:36,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2018-11-07 08:24:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:24:36,558 INFO L225 Difference]: With dead ends: 5487 [2018-11-07 08:24:36,558 INFO L226 Difference]: Without dead ends: 3606 [2018-11-07 08:24:36,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2018-11-07 08:24:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2018-11-07 08:24:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3518. [2018-11-07 08:24:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3518 states. [2018-11-07 08:24:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 4925 transitions. [2018-11-07 08:24:36,741 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 4925 transitions. Word has length 207 [2018-11-07 08:24:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:24:36,741 INFO L480 AbstractCegarLoop]: Abstraction has 3518 states and 4925 transitions. [2018-11-07 08:24:36,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 08:24:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 4925 transitions. [2018-11-07 08:24:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 08:24:36,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:36,762 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:24:36,763 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:36,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1729382700, now seen corresponding path program 1 times [2018-11-07 08:24:36,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:36,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:36,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 08:24:37,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:24:37,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:24:37,168 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-07 08:24:37,168 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:24:37,175 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:24:37,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:24:37,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 08:24:37,395 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 08:24:37,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:37,430 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 08:24:37,992 INFO L227 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.45% of their original sizes. [2018-11-07 08:24:37,993 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 08:24:38,249 INFO L415 sIntCurrentIteration]: We unified 213 AI predicates to 213 [2018-11-07 08:24:38,249 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 08:24:38,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 08:24:38,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 08:24:38,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:24:38,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 08:24:38,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 08:24:38,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 08:24:38,252 INFO L87 Difference]: Start difference. First operand 3518 states and 4925 transitions. Second operand 6 states. [2018-11-07 08:24:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:24:55,085 INFO L93 Difference]: Finished difference Result 7176 states and 10042 transitions. [2018-11-07 08:24:55,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 08:24:55,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2018-11-07 08:24:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:24:55,116 INFO L225 Difference]: With dead ends: 7176 [2018-11-07 08:24:55,117 INFO L226 Difference]: Without dead ends: 3664 [2018-11-07 08:24:55,151 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 08:24:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2018-11-07 08:24:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2018-11-07 08:24:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2018-11-07 08:24:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5076 transitions. [2018-11-07 08:24:55,296 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5076 transitions. Word has length 214 [2018-11-07 08:24:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:24:55,296 INFO L480 AbstractCegarLoop]: Abstraction has 3662 states and 5076 transitions. [2018-11-07 08:24:55,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 08:24:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5076 transitions. [2018-11-07 08:24:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-07 08:24:55,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:24:55,323 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 08:24:55,323 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:24:55,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 66252833, now seen corresponding path program 1 times [2018-11-07 08:24:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:24:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:55,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:24:55,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:24:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:55,669 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 08:24:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 144 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 08:24:56,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:24:56,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:24:56,760 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-11-07 08:24:56,761 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:24:56,768 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:24:56,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:24:57,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:24:57,254 INFO L272 AbstractInterpreter]: Visited 93 different actions 280 times. Merged at 8 different actions 24 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 08:24:57,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:24:57,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:24:57,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:24:57,293 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 08:24:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:24:57,313 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:24:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:24:57,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:24:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 325 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 08:24:57,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:24:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 219 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 08:24:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 08:24:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 08:24:58,064 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 08:24:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 08:24:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 08:24:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 08:24:58,068 INFO L87 Difference]: Start difference. First operand 3662 states and 5076 transitions. Second operand 11 states. [2018-11-07 08:25:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:25:03,444 INFO L93 Difference]: Finished difference Result 10630 states and 15967 transitions. [2018-11-07 08:25:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 08:25:03,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 294 [2018-11-07 08:25:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:25:03,466 INFO L225 Difference]: With dead ends: 10630 [2018-11-07 08:25:03,466 INFO L226 Difference]: Without dead ends: 2890 [2018-11-07 08:25:03,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 595 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-07 08:25:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-07 08:25:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2353. [2018-11-07 08:25:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2018-11-07 08:25:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 2955 transitions. [2018-11-07 08:25:03,635 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 2955 transitions. Word has length 294 [2018-11-07 08:25:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:25:03,635 INFO L480 AbstractCegarLoop]: Abstraction has 2353 states and 2955 transitions. [2018-11-07 08:25:03,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 08:25:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2955 transitions. [2018-11-07 08:25:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-07 08:25:03,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:25:03,644 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 08:25:03,645 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:25:03,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:25:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 812385817, now seen corresponding path program 1 times [2018-11-07 08:25:03,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:25:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:25:03,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:25:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:25:03,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:25:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:25:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 300 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 08:25:04,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:25:04,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:25:04,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-11-07 08:25:04,093 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:25:04,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:25:04,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:25:04,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:25:04,509 INFO L272 AbstractInterpreter]: Visited 126 different actions 379 times. Merged at 8 different actions 25 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 08:25:04,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:25:04,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:25:04,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:25:04,526 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 08:25:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:25:04,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:25:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:25:04,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:25:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 300 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 08:25:05,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:25:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 300 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 08:25:05,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 08:25:05,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 08:25:05,431 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 08:25:05,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 08:25:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 08:25:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 08:25:05,432 INFO L87 Difference]: Start difference. First operand 2353 states and 2955 transitions. Second operand 9 states. [2018-11-07 08:25:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:25:07,723 INFO L93 Difference]: Finished difference Result 4433 states and 5630 transitions. [2018-11-07 08:25:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 08:25:07,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 330 [2018-11-07 08:25:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:25:07,746 INFO L225 Difference]: With dead ends: 4433 [2018-11-07 08:25:07,746 INFO L226 Difference]: Without dead ends: 2230 [2018-11-07 08:25:07,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 662 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-07 08:25:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-11-07 08:25:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2140. [2018-11-07 08:25:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-11-07 08:25:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2453 transitions. [2018-11-07 08:25:07,831 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2453 transitions. Word has length 330 [2018-11-07 08:25:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:25:07,832 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 2453 transitions. [2018-11-07 08:25:07,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 08:25:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2453 transitions. [2018-11-07 08:25:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-07 08:25:07,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:25:07,842 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 08:25:07,843 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:25:07,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:25:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1037984411, now seen corresponding path program 1 times [2018-11-07 08:25:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:25:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:25:07,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:25:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:25:07,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:25:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:25:08,550 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-07 08:25:08,769 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 08:25:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 229 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 08:25:09,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:25:09,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 08:25:09,344 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 341 with the following transitions: [2018-11-07 08:25:09,345 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 08:25:09,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 08:25:09,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 08:25:12,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 08:25:12,268 INFO L272 AbstractInterpreter]: Visited 126 different actions 379 times. Merged at 8 different actions 25 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 08:25:12,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:25:12,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 08:25:12,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 08:25:12,276 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 08:25:12,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:25:12,285 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 08:25:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:25:12,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 08:25:12,556 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 08:25:33,198 WARN L179 SmtUtils]: Spent 20.54 s on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2018-11-07 08:25:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 341 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 08:25:34,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 08:25:34,207 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-07 08:25:46,818 WARN L179 SmtUtils]: Spent 11.60 s on a formula simplification. DAG size of input: 384 DAG size of output: 22 [2018-11-07 08:25:47,007 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-07 08:25:47,119 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-11-07 08:25:47,472 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-11-07 08:25:47,475 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,550 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,597 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,656 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,697 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:47,823 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,016 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,055 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,131 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,190 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,237 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,322 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,362 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,565 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:48,904 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,076 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,151 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,525 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,585 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,627 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,671 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,757 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,897 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,943 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:49,991 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,325 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,559 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,641 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,679 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,804 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,845 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,884 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,926 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:50,965 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,007 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,054 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,096 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,137 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,180 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,225 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,379 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,417 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,489 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,582 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,626 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,774 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,814 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,852 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:51,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,105 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,143 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,185 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,221 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,263 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,300 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,439 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,514 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,591 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,631 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:52,977 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,035 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,208 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,257 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,301 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:53,893 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:54,202 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:54,519 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:54,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:54,858 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:54,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:54,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,004 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,041 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,099 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,436 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,479 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,555 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,629 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,671 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,747 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:55,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-07 08:25:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 148 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 08:25:56,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 08:25:56,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-11-07 08:25:56,465 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 08:25:56,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 08:25:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 08:25:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-11-07 08:25:56,467 INFO L87 Difference]: Start difference. First operand 2140 states and 2453 transitions. Second operand 18 states. [2018-11-07 08:25:59,401 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2018-11-07 08:26:22,149 WARN L179 SmtUtils]: Spent 20.19 s on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-11-07 08:26:27,935 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2018-11-07 08:26:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:26:27,999 INFO L93 Difference]: Finished difference Result 6389 states and 7770 transitions. [2018-11-07 08:26:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 08:26:28,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 340 [2018-11-07 08:26:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:26:28,020 INFO L225 Difference]: With dead ends: 6389 [2018-11-07 08:26:28,020 INFO L226 Difference]: Without dead ends: 3959 [2018-11-07 08:26:28,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 591 SyntacticMatches, 111 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3396 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=800, Invalid=2860, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 08:26:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2018-11-07 08:26:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2774. [2018-11-07 08:26:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2018-11-07 08:26:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3255 transitions. [2018-11-07 08:26:28,126 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3255 transitions. Word has length 340 [2018-11-07 08:26:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:26:28,127 INFO L480 AbstractCegarLoop]: Abstraction has 2774 states and 3255 transitions. [2018-11-07 08:26:28,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 08:26:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3255 transitions. [2018-11-07 08:26:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-07 08:26:28,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 08:26:28,138 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 08:26:28,138 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 08:26:28,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 08:26:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 935343302, now seen corresponding path program 1 times [2018-11-07 08:26:28,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 08:26:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:26:28,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 08:26:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 08:26:28,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 08:26:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 08:26:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-07 08:26:28,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 08:26:28,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 08:26:28,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 08:26:28,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 08:26:28,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 08:26:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:26:28,568 INFO L87 Difference]: Start difference. First operand 2774 states and 3255 transitions. Second operand 3 states. [2018-11-07 08:26:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 08:26:29,841 INFO L93 Difference]: Finished difference Result 6131 states and 7305 transitions. [2018-11-07 08:26:29,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 08:26:29,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2018-11-07 08:26:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 08:26:29,843 INFO L225 Difference]: With dead ends: 6131 [2018-11-07 08:26:29,843 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 08:26:29,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 08:26:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 08:26:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 08:26:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 08:26:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 08:26:29,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 359 [2018-11-07 08:26:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 08:26:29,853 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 08:26:29,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 08:26:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 08:26:29,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 08:26:29,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 08:26:30,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,443 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 247 [2018-11-07 08:26:30,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 08:26:30,863 WARN L179 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 244 [2018-11-07 08:26:31,279 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2018-11-07 08:26:31,837 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2018-11-07 08:26:37,744 WARN L179 SmtUtils]: Spent 5.90 s on a formula simplification. DAG size of input: 238 DAG size of output: 54 [2018-11-07 08:26:37,969 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-07 08:26:41,031 WARN L179 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 255 DAG size of output: 49 [2018-11-07 08:26:42,082 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 252 DAG size of output: 49 [2018-11-07 08:26:42,085 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,086 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,087 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 08:26:42,088 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-07 08:26:42,089 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,090 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 08:26:42,091 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,092 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-07 08:26:42,093 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 08:26:42,094 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,095 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 08:26:42,096 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,097 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 08:26:42,098 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 08:26:42,099 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-07 08:26:42,099 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-07 08:26:42,099 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse10 (= ~a1~0 |old(~a1~0)|)) (.cse9 (= ~a19~0 |old(~a19~0)|)) (.cse8 (= |old(~a10~0)| ~a10~0))) (let ((.cse4 (< 2 |old(~a10~0)|)) (.cse1 (and .cse10 .cse9 .cse8)) (.cse7 (and (= |old(~a19~0)| ~a19~0) .cse8 .cse10)) (.cse6 (< 8 |old(~a19~0)|)) (.cse5 (= 3 |old(~a10~0)|)) (.cse3 (= 7 |old(~a19~0)|)) (.cse0 (not (= 14 ~a4~0))) (.cse2 (not (= 0 ~a12~0)))) (and (or .cse0 .cse1 .cse2 (not (= 9 |old(~a19~0)|))) (or .cse1 (or .cse3 .cse0 .cse2 .cse4)) (or .cse5 .cse3 .cse6 .cse7) (or (< (+ |old(~a1~0)| 12) 0) (or .cse0 .cse2 .cse4) .cse1) (or .cse7 .cse6 (not (= 2 |old(~a10~0)|))) (or .cse7 .cse3 .cse6 (= 8 |old(~a19~0)|)) (or (or .cse5 .cse3 (= 10 |old(~a19~0)|)) (and .cse8 .cse9 .cse10) .cse0 .cse2)))) [2018-11-07 08:26:42,099 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-07 08:26:42,099 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-07 08:26:42,099 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-07 08:26:42,099 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 08:26:42,100 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2018-11-07 08:26:42,101 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-07 08:26:42,102 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,103 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 08:26:42,104 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 08:26:42,105 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~a1~0 23) (= ~a4~0 14)) [2018-11-07 08:26:42,106 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 08:26:42,106 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 08:26:42,106 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= 14 ~a4~0)) (not (= 23 |old(~a1~0)|)) (and (= ~a1~0 23) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 0 |old(~a10~0)|))) [2018-11-07 08:26:42,106 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-07 08:26:42,106 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (not (= ~a19~0 7))) (.cse0 (<= ~a10~0 2))) (or (not (= 23 |old(~a1~0)|)) (= 2 ~a10~0) (not (= 0 ~a12~0)) (not (= 0 |old(~a10~0)|)) (and .cse0 (<= 0 (+ ~a1~0 12))) (not (= 9 |old(~a19~0)|)) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and (not (= ~a10~0 3)) .cse1 (not (= ~a19~0 10))) (and .cse1 .cse0) (not (= 14 ~a4~0)))) [2018-11-07 08:26:42,106 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-07 08:26:42,106 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-07 08:26:42,107 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-07 08:26:42,107 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (not (= ~a19~0 7))) (.cse0 (<= ~a10~0 2))) (or (not (= 23 |old(~a1~0)|)) (= 2 ~a10~0) (not (= 0 ~a12~0)) (not (= 0 |old(~a10~0)|)) (and .cse0 (<= 0 (+ ~a1~0 12))) (not (= 9 |old(~a19~0)|)) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and (not (= ~a10~0 3)) .cse1 (not (= ~a19~0 10))) (and .cse1 .cse0) (not (= 14 ~a4~0)))) [2018-11-07 08:26:42,107 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-07 08:26:42,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:26:42 BoogieIcfgContainer [2018-11-07 08:26:42,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 08:26:42,121 INFO L168 Benchmark]: Toolchain (without parser) took 150971.15 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -488.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 08:26:42,122 INFO L168 Benchmark]: CDTParser took 0.20 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 08:26:42,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 08:26:42,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2018-11-07 08:26:42,125 INFO L168 Benchmark]: Boogie Preprocessor took 96.14 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 08:26:42,125 INFO L168 Benchmark]: RCFGBuilder took 3185.90 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: 103.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2018-11-07 08:26:42,126 INFO L168 Benchmark]: TraceAbstraction took 146814.64 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 205.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 08:26:42,146 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.20 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 734.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.14 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 3185.90 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: 103.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146814.64 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 205.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((!(23 == \old(a1)) || 2 == a10) || !(0 == a12)) || !(0 == \old(a10))) || (a10 <= 2 && 0 <= a1 + 12)) || !(9 == \old(a19))) || (a19 <= \old(a19) && 9 <= a19)) || ((!(a19 == 7) && !(a19 == 8)) && a19 <= 8)) || ((!(a10 == 3) && !(a19 == 7)) && !(a19 == 10))) || (!(a19 == 7) && a10 <= 2)) || !(14 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 146.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 73.1s AutomataDifference, 0.0s DeadEndRemovalTime, 12.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 893 SDtfs, 8523 SDslu, 1381 SDs, 0 SdLazy, 15918 SolverSat, 2722 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 36.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2751 GetRequests, 2486 SyntacticMatches, 123 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3604 ImplicationChecksByTransitivity, 70.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3662occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9973568684836293 AbsIntWeakeningRatio, 0.12206572769953052 AbsIntAvgWeakeningVarsNumRemoved, 15.417840375586854 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 1987 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 222 PreInvPairs, 370 NumberOfFragments, 375 HoareAnnotationTreeSize, 222 FomulaSimplifications, 54398 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17054 FormulaSimplificationTreeSizeReductionInter, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 3432 NumberOfCodeBlocks, 3432 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4585 ConstructedInterpolants, 126 QuantifiedInterpolants, 8635202 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1978 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 3970/4618 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...