java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:12:24,290 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:12:24,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:12:24,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:12:24,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:12:24,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:12:24,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:12:24,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:12:24,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:12:24,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:12:24,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:12:24,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:12:24,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:12:24,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:12:24,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:12:24,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:12:24,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:12:24,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:12:24,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:12:24,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:12:24,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:12:24,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:12:24,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:12:24,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:12:24,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:12:24,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:12:24,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:12:24,357 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:12:24,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:12:24,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:12:24,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:12:24,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:12:24,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:12:24,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:12:24,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:12:24,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:12:24,362 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:12:24,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:12:24,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:12:24,378 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:12:24,378 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:12:24,379 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:12:24,379 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:12:24,379 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:12:24,379 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:12:24,379 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:12:24,380 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:12:24,380 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:12:24,382 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:12:24,382 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:12:24,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:12:24,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:12:24,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:12:24,383 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:12:24,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:12:24,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:12:24,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:12:24,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:12:24,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:12:24,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:12:24,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:12:24,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:12:24,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:12:24,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:12:24,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:12:24,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:12:24,386 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:12:24,387 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:12:24,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:12:24,387 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:12:24,387 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:12:24,387 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:12:24,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:12:24,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:12:24,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:12:24,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:12:24,469 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:12:24,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-11-12 17:12:24,542 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d365be6/d6f30c7fcd444beb891b76eddb2f1573/FLAGe4977f9e4 [2018-11-12 17:12:25,180 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:12:25,181 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-11-12 17:12:25,195 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d365be6/d6f30c7fcd444beb891b76eddb2f1573/FLAGe4977f9e4 [2018-11-12 17:12:25,214 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d365be6/d6f30c7fcd444beb891b76eddb2f1573 [2018-11-12 17:12:25,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:12:25,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:12:25,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:12:25,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:12:25,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:12:25,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:25" (1/1) ... [2018-11-12 17:12:25,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c43ad98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:25, skipping insertion in model container [2018-11-12 17:12:25,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:25" (1/1) ... [2018-11-12 17:12:25,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:12:25,319 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:12:25,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:12:25,874 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:12:26,009 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:12:26,034 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:12:26,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26 WrapperNode [2018-11-12 17:12:26,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:12:26,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:12:26,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:12:26,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:12:26,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:12:26,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:12:26,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:12:26,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:12:26,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... [2018-11-12 17:12:26,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:12:26,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:12:26,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:12:26,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:12:26,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:12:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:12:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:12:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:12:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:12:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:12:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:12:26,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:12:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:12:26,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:12:29,472 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:12:29,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:29 BoogieIcfgContainer [2018-11-12 17:12:29,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:12:29,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:12:29,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:12:29,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:12:29,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:12:25" (1/3) ... [2018-11-12 17:12:29,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b8d280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:29, skipping insertion in model container [2018-11-12 17:12:29,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:26" (2/3) ... [2018-11-12 17:12:29,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b8d280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:29, skipping insertion in model container [2018-11-12 17:12:29,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:29" (3/3) ... [2018-11-12 17:12:29,490 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label12_true-unreach-call_false-termination.c [2018-11-12 17:12:29,501 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:12:29,512 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:12:29,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:12:29,584 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:12:29,584 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:12:29,584 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:12:29,585 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:12:29,585 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:12:29,585 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:12:29,585 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:12:29,585 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:12:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:12:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 17:12:29,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:29,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:29,633 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:29,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash -426831369, now seen corresponding path program 1 times [2018-11-12 17:12:29,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:29,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:30,248 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:12:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:30,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:30,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:12:30,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:30,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:12:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:12:30,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:12:30,412 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:12:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:31,804 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-12 17:12:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:12:31,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-12 17:12:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:31,826 INFO L225 Difference]: With dead ends: 621 [2018-11-12 17:12:31,826 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:12:31,833 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-12 17:12:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:12:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-12 17:12:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:12:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-12 17:12:31,910 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 125 [2018-11-12 17:12:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:31,911 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-12 17:12:31,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:12:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-12 17:12:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 17:12:31,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:31,918 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:31,918 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:31,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:31,919 INFO L82 PathProgramCache]: Analyzing trace with hash 973432330, now seen corresponding path program 1 times [2018-11-12 17:12:31,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:31,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:31,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:31,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:31,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:32,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:32,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:12:32,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:32,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:12:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:12:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:32,324 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-12 17:12:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:34,024 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-12 17:12:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:34,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-12 17:12:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:34,037 INFO L225 Difference]: With dead ends: 903 [2018-11-12 17:12:34,037 INFO L226 Difference]: Without dead ends: 381 [2018-11-12 17:12:34,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-12 17:12:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-12 17:12:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-12 17:12:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-12 17:12:34,076 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 134 [2018-11-12 17:12:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:34,077 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-12 17:12:34,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:12:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-12 17:12:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 17:12:34,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:34,081 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:34,081 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:34,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1888571286, now seen corresponding path program 1 times [2018-11-12 17:12:34,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:34,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:34,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:34,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:34,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:34,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:34,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:12:34,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:34,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:12:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:12:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:34,576 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-12 17:12:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:36,147 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-12 17:12:36,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:36,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-11-12 17:12:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:36,151 INFO L225 Difference]: With dead ends: 901 [2018-11-12 17:12:36,151 INFO L226 Difference]: Without dead ends: 380 [2018-11-12 17:12:36,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-12 17:12:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-12 17:12:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-12 17:12:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-12 17:12:36,169 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 140 [2018-11-12 17:12:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:36,169 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-12 17:12:36,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:12:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-12 17:12:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-12 17:12:36,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:36,172 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:36,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:36,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash -570889491, now seen corresponding path program 1 times [2018-11-12 17:12:36,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:36,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:36,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:36,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:36,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:36,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:36,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:36,369 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-12 17:12:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:38,782 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-12 17:12:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:12:38,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-12 17:12:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:38,788 INFO L225 Difference]: With dead ends: 1193 [2018-11-12 17:12:38,789 INFO L226 Difference]: Without dead ends: 819 [2018-11-12 17:12:38,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:12:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-12 17:12:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-12 17:12:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-12 17:12:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-12 17:12:38,825 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 148 [2018-11-12 17:12:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:38,825 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-12 17:12:38,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-12 17:12:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-12 17:12:38,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:38,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:38,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:38,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash -489152655, now seen corresponding path program 1 times [2018-11-12 17:12:38,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:38,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:38,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:39,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:39,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:12:39,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:39,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:12:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:12:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:39,215 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-12 17:12:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:40,231 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-12 17:12:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:40,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-11-12 17:12:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:40,247 INFO L225 Difference]: With dead ends: 1753 [2018-11-12 17:12:40,248 INFO L226 Difference]: Without dead ends: 804 [2018-11-12 17:12:40,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-12 17:12:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-12 17:12:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-12 17:12:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-12 17:12:40,285 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 150 [2018-11-12 17:12:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-12 17:12:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:12:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-12 17:12:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-12 17:12:40,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:40,289 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:40,290 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:40,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash -603913227, now seen corresponding path program 1 times [2018-11-12 17:12:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:40,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:40,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:12:40,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:40,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:12:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:12:40,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:40,516 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-12 17:12:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:41,914 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-12 17:12:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:41,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2018-11-12 17:12:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:41,920 INFO L225 Difference]: With dead ends: 1747 [2018-11-12 17:12:41,920 INFO L226 Difference]: Without dead ends: 801 [2018-11-12 17:12:41,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-12 17:12:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-12 17:12:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-12 17:12:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-12 17:12:41,944 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 152 [2018-11-12 17:12:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:41,944 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-12 17:12:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:12:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-12 17:12:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 17:12:41,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:41,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:41,949 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:41,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash 931126525, now seen corresponding path program 1 times [2018-11-12 17:12:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:41,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:41,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:41,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:42,152 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:12:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:42,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:42,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:42,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:42,497 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-12 17:12:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:43,717 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-12 17:12:43,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:12:43,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-11-12 17:12:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:43,729 INFO L225 Difference]: With dead ends: 2381 [2018-11-12 17:12:43,729 INFO L226 Difference]: Without dead ends: 1586 [2018-11-12 17:12:43,734 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-12 17:12:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-12 17:12:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-12 17:12:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-12 17:12:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-12 17:12:43,780 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 156 [2018-11-12 17:12:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:43,781 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-12 17:12:43,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-12 17:12:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-12 17:12:43,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:43,786 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:43,786 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:43,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:43,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1732925114, now seen corresponding path program 1 times [2018-11-12 17:12:43,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:43,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:43,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:44,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:44,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:44,083 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-11-12 17:12:44,085 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:44,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:44,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:46,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:12:46,175 INFO L272 AbstractInterpreter]: Visited 130 different actions 386 times. Merged at 7 different actions 20 times. Never widened. Performed 5545 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5545 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:12:46,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:46,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:12:46,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:46,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:12:46,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:46,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:12:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:46,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:12:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:12:46,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:12:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:12:47,083 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:47,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-11-12 17:12:47,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:47,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:12:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:12:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:12:47,085 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-11-12 17:12:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:49,268 INFO L93 Difference]: Finished difference Result 3798 states and 5500 transitions. [2018-11-12 17:12:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:12:49,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-12 17:12:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:49,283 INFO L225 Difference]: With dead ends: 3798 [2018-11-12 17:12:49,283 INFO L226 Difference]: Without dead ends: 2246 [2018-11-12 17:12:49,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:12:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-11-12 17:12:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2018-11-12 17:12:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-11-12 17:12:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3096 transitions. [2018-11-12 17:12:49,363 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3096 transitions. Word has length 162 [2018-11-12 17:12:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:49,365 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 3096 transitions. [2018-11-12 17:12:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:12:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3096 transitions. [2018-11-12 17:12:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-12 17:12:49,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:49,375 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:49,376 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:49,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 30439215, now seen corresponding path program 1 times [2018-11-12 17:12:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:49,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:49,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:49,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:49,840 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-11-12 17:12:49,840 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:49,847 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:49,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:50,629 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:50,629 INFO L272 AbstractInterpreter]: Visited 129 different actions 252 times. Merged at 5 different actions 5 times. Never widened. Performed 4253 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4253 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:12:50,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:50,657 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:51,760 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 82.29% of their original sizes. [2018-11-12 17:12:51,761 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:54,543 INFO L415 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-11-12 17:12:54,543 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:54,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:54,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-12 17:12:54,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:54,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:12:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:12:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:12:54,545 INFO L87 Difference]: Start difference. First operand 2246 states and 3096 transitions. Second operand 15 states. [2018-11-12 17:13:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:17,139 INFO L93 Difference]: Finished difference Result 5532 states and 7687 transitions. [2018-11-12 17:13:17,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:13:17,140 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2018-11-12 17:13:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:17,156 INFO L225 Difference]: With dead ends: 5532 [2018-11-12 17:13:17,156 INFO L226 Difference]: Without dead ends: 3292 [2018-11-12 17:13:17,166 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 132 SyntacticMatches, 45 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:13:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2018-11-12 17:13:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3286. [2018-11-12 17:13:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3286 states. [2018-11-12 17:13:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4268 transitions. [2018-11-12 17:13:17,246 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4268 transitions. Word has length 191 [2018-11-12 17:13:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:17,246 INFO L480 AbstractCegarLoop]: Abstraction has 3286 states and 4268 transitions. [2018-11-12 17:13:17,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:13:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4268 transitions. [2018-11-12 17:13:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 17:13:17,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:17,256 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:17,257 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:17,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1701733779, now seen corresponding path program 1 times [2018-11-12 17:13:17,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:17,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:17,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:17,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:17,721 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-12 17:13:17,722 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:17,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:17,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:18,413 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:18,414 INFO L272 AbstractInterpreter]: Visited 129 different actions 254 times. Merged at 5 different actions 7 times. Never widened. Performed 3617 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3617 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:13:18,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:18,415 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:18,880 INFO L227 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 81.17% of their original sizes. [2018-11-12 17:13:18,880 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:19,881 INFO L415 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2018-11-12 17:13:19,881 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:19,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:19,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:13:19,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:19,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:13:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:13:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:13:19,883 INFO L87 Difference]: Start difference. First operand 3286 states and 4268 transitions. Second operand 18 states. [2018-11-12 17:13:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:30,747 INFO L93 Difference]: Finished difference Result 6581 states and 8613 transitions. [2018-11-12 17:13:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:13:30,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 194 [2018-11-12 17:13:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:30,763 INFO L225 Difference]: With dead ends: 6581 [2018-11-12 17:13:30,763 INFO L226 Difference]: Without dead ends: 3747 [2018-11-12 17:13:30,773 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:13:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2018-11-12 17:13:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3592. [2018-11-12 17:13:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-11-12 17:13:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4597 transitions. [2018-11-12 17:13:30,857 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4597 transitions. Word has length 194 [2018-11-12 17:13:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:30,858 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 4597 transitions. [2018-11-12 17:13:30,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:13:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4597 transitions. [2018-11-12 17:13:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 17:13:30,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:30,868 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:13:30,869 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:30,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash -85689423, now seen corresponding path program 1 times [2018-11-12 17:13:30,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:30,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:13:31,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:31,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:31,115 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-11-12 17:13:31,115 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:31,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:31,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:31,982 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:31,982 INFO L272 AbstractInterpreter]: Visited 129 different actions 385 times. Merged at 7 different actions 20 times. Never widened. Performed 5240 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:31,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:31,988 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:32,268 INFO L227 lantSequenceWeakener]: Weakened 206 states. On average, predicates are now at 80.93% of their original sizes. [2018-11-12 17:13:32,268 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:32,413 INFO L415 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-11-12 17:13:32,414 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:32,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:32,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-12 17:13:32,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:32,415 INFO L87 Difference]: Start difference. First operand 3592 states and 4597 transitions. Second operand 11 states. [2018-11-12 17:13:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:39,733 INFO L93 Difference]: Finished difference Result 8810 states and 11596 transitions. [2018-11-12 17:13:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 17:13:39,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2018-11-12 17:13:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:39,756 INFO L225 Difference]: With dead ends: 8810 [2018-11-12 17:13:39,756 INFO L226 Difference]: Without dead ends: 5525 [2018-11-12 17:13:39,768 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:13:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2018-11-12 17:13:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5454. [2018-11-12 17:13:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5454 states. [2018-11-12 17:13:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 6728 transitions. [2018-11-12 17:13:39,907 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 6728 transitions. Word has length 209 [2018-11-12 17:13:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:39,907 INFO L480 AbstractCegarLoop]: Abstraction has 5454 states and 6728 transitions. [2018-11-12 17:13:39,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 6728 transitions. [2018-11-12 17:13:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-12 17:13:39,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:39,924 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, 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] [2018-11-12 17:13:39,925 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -863981217, now seen corresponding path program 1 times [2018-11-12 17:13:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:39,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:39,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:39,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:39,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-12 17:13:40,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:40,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:13:40,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:40,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:13:40,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:13:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:13:40,126 INFO L87 Difference]: Start difference. First operand 5454 states and 6728 transitions. Second operand 3 states. [2018-11-12 17:13:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:41,036 INFO L93 Difference]: Finished difference Result 10616 states and 13191 transitions. [2018-11-12 17:13:41,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:13:41,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-12 17:13:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:41,055 INFO L225 Difference]: With dead ends: 10616 [2018-11-12 17:13:41,055 INFO L226 Difference]: Without dead ends: 5312 [2018-11-12 17:13:41,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:13:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2018-11-12 17:13:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4961. [2018-11-12 17:13:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4961 states. [2018-11-12 17:13:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 5919 transitions. [2018-11-12 17:13:41,183 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 5919 transitions. Word has length 233 [2018-11-12 17:13:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:41,183 INFO L480 AbstractCegarLoop]: Abstraction has 4961 states and 5919 transitions. [2018-11-12 17:13:41,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:13:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 5919 transitions. [2018-11-12 17:13:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-12 17:13:41,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:41,201 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:41,201 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:41,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1255293909, now seen corresponding path program 1 times [2018-11-12 17:13:41,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:41,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:41,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:41,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 227 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:13:41,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:41,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:41,914 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-11-12 17:13:41,915 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [260], [263], [267], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:41,917 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:41,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:42,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:42,461 INFO L272 AbstractInterpreter]: Visited 131 different actions 387 times. Merged at 7 different actions 18 times. Never widened. Performed 5648 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5648 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:42,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:42,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:42,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:42,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:13:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:42,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:42,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-12 17:13:42,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-12 17:13:43,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:13:43,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:13:43,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:13:43,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:13:43,171 INFO L87 Difference]: Start difference. First operand 4961 states and 5919 transitions. Second operand 11 states. [2018-11-12 17:13:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:49,136 INFO L93 Difference]: Finished difference Result 15963 states and 20830 transitions. [2018-11-12 17:13:49,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 17:13:49,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 299 [2018-11-12 17:13:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:49,142 INFO L225 Difference]: With dead ends: 15963 [2018-11-12 17:13:49,142 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:13:49,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 611 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 17:13:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:13:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:13:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:13:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:13:49,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2018-11-12 17:13:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:49,195 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:13:49,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:13:49,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:13:49,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:13:49,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:49,970 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 119 [2018-11-12 17:13:50,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:50,521 WARN L179 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 207 [2018-11-12 17:13:51,414 WARN L179 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-11-12 17:13:51,778 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 77 [2018-11-12 17:13:57,629 WARN L179 SmtUtils]: Spent 5.83 s on a formula simplification. DAG size of input: 383 DAG size of output: 111 [2018-11-12 17:13:58,492 WARN L179 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 107 [2018-11-12 17:13:59,491 WARN L179 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 104 [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:59,494 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= |old(~a25~0)| ~a25~0)) [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,494 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:13:59,495 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:13:59,496 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:13:59,497 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:13:59,498 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:13:59,499 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:13:59,500 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,501 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:13:59,502 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:59,503 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,504 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:13:59,505 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,506 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:13:59,507 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,508 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:13:59,509 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,510 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,511 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse15 (= 1 |old(~a19~0)|)) (.cse7 (<= 0 ~a11~0)) (.cse9 (<= ~a11~0 1)) (.cse10 (= ~a17~0 8)) (.cse1 (= 1 |old(~a11~0)|)) (.cse21 (= 1 |old(~a25~0)|)) (.cse29 (<= ~a17~0 |old(~a17~0)|)) (.cse8 (= |old(~a28~0)| ~a28~0)) (.cse30 (= |old(~a19~0)| ~a19~0)) (.cse31 (= |old(~a25~0)| ~a25~0))) (let ((.cse6 (< |old(~a28~0)| 7)) (.cse18 (= 8 ~a17~0)) (.cse19 (= 1 ~a19~0)) (.cse3 (= 9 |old(~a28~0)|)) (.cse23 (and .cse29 .cse8 .cse30 .cse31)) (.cse22 (< 7 |old(~a17~0)|)) (.cse16 (not (= 7 |old(~a28~0)|))) (.cse24 (not .cse21)) (.cse20 (not .cse1)) (.cse17 (= 1 ~a11~0)) (.cse2 (and .cse29 .cse8 .cse30 .cse31 (not (= ~a11~0 1)))) (.cse25 (< |old(~a19~0)| 1)) (.cse4 (< 6 |calculate_output_#in~input|)) (.cse0 (not (= 1 ~a21~0))) (.cse26 (and .cse7 .cse9 .cse10)) (.cse5 (< 1 |old(~a11~0)|)) (.cse11 (< |old(~a11~0)| 0)) (.cse12 (not .cse15)) (.cse28 (< |old(~a28~0)| 10)) (.cse27 (< 11 |old(~a28~0)|)) (.cse13 (not (= 8 |old(~a17~0)|))) (.cse14 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (or .cse0 (< 9 |old(~a28~0)|) .cse5 (not (= 0 |old(~a25~0)|))) .cse6 (and .cse7 .cse8 .cse9 (= ~a25~0 0) .cse10 (= ~a19~0 1)) .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse0 .cse16 .cse13 (and (= 7 ~a28~0) (not (= ~a25~0 1)) .cse17 .cse18 (not .cse19)) .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse22) (or .cse0 .cse1 (not (= |old(~a19~0)| 1)) .cse2) (or .cse0 .cse23 .cse24 .cse3 .cse25) (or .cse23 .cse15 .cse0 .cse24 .cse22) (or .cse4 .cse0 .cse24 .cse5 .cse6 .cse26 .cse11 .cse12 .cse27 .cse13 .cse14) (or (and .cse17 .cse18) .cse0 (not (= 10 |old(~a28~0)|)) .cse24 .cse12 .cse13 .cse20) (or .cse0 .cse24 .cse12 .cse13 (and .cse17 (= 1 ~a25~0) (= 9 ~a28~0) .cse18 .cse19) (not .cse3) .cse20) (or .cse23 .cse0 .cse28 .cse22) (or .cse0 .cse16 .cse24 .cse12 .cse20 (and .cse17 (= 7 ~a17~0)) (not (= 7 |old(~a17~0)|))) (or .cse2 .cse0 .cse1 .cse25 .cse21) (or .cse4 .cse0 .cse26 .cse5 (< |old(~a25~0)| 0) .cse1 .cse11 .cse12 (< 1 |old(~a25~0)|) .cse28 .cse27 .cse13 .cse14)))) [2018-11-12 17:13:59,511 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,511 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,511 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:13:59,512 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,513 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:13:59,514 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 526) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,515 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:13:59,516 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:59,517 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:13:59,518 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:13:59,518 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:59,518 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:13:59,518 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:13:59,518 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:59,518 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:13:59,518 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:13:59,519 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (not (= ~a28~0 9))) (.cse0 (<= ~a17~0 7)) (.cse2 (= 1 ~a25~0)) (.cse3 (= 8 ~a17~0)) (.cse4 (= 1 ~a19~0)) (.cse8 (= ~a19~0 1)) (.cse5 (<= ~a17~0 |old(~a17~0)|)) (.cse9 (not (= ~a25~0 1))) (.cse1 (not (= ~a11~0 1))) (.cse7 (<= 1 ~a19~0))) (or (and .cse0 (<= 10 ~a28~0)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse5 (and .cse1 .cse6)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse5 .cse2 .cse6 .cse7) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (not .cse8) .cse0 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (= 7 ~a28~0) .cse9 .cse3 (not .cse4)) (not (= |old(~a11~0)| 0)) (and (<= 7 ~a28~0) (= ~a25~0 0) (= ~a17~0 8) .cse8 (<= ~a28~0 9)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and .cse5 .cse9 .cse1 .cse7) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:13:59,519 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:59,519 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:59,519 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1)) (.cse0 (<= ~a17~0 7)) (.cse2 (= 1 ~a25~0)) (.cse3 (= 8 ~a17~0)) (.cse4 (= 1 ~a19~0)) (.cse7 (not (= ~a28~0 9))) (.cse6 (<= ~a17~0 |old(~a17~0)|)) (.cse9 (not (= ~a25~0 1))) (.cse1 (not (= ~a11~0 1))) (.cse8 (<= 1 ~a19~0))) (or (and .cse0 (<= 10 ~a28~0)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and (<= 1 main_~input~0) (and (= ~a25~0 0) (= ~a17~0 8) (<= ~a28~0 9) (<= 7 ~a28~0)) (<= main_~input~0 6) .cse5) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse6 .cse2 .cse7 .cse8) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (not .cse5) .cse0 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (= 7 ~a28~0) .cse9 .cse3 (not .cse4)) (not (= |old(~a11~0)| 0)) (and .cse6 .cse1 .cse7) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and .cse6 .cse9 .cse1 .cse8) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:13:59,519 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:13:59,520 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:13:59,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:13:59 BoogieIcfgContainer [2018-11-12 17:13:59,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:13:59,535 INFO L168 Benchmark]: Toolchain (without parser) took 94307.26 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -959.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:59,536 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:13:59,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:59,537 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:59,538 INFO L168 Benchmark]: Boogie Preprocessor took 108.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:59,539 INFO L168 Benchmark]: RCFGBuilder took 3197.80 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.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:59,540 INFO L168 Benchmark]: TraceAbstraction took 90059.28 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -273.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:59,545 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.28 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 805.34 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 131.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3197.80 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.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90059.28 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -273.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 526]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((a17 <= 7 && 10 <= a28) || (a17 <= 7 && !(a11 == 1))) || ((1 == a25 && 8 == a17) && 1 == a19)) || !(a21 == 1)) || !(y == 25)) || (a17 <= \old(a17) && !(a11 == 1) && !(a28 == 9))) || !(1 == \old(a19))) || !(x == 24)) || (((a17 <= \old(a17) && 1 == a25) && !(a28 == 9)) && 1 <= a19)) || !(e == 5)) || !(d == 4)) || ((!(a19 == 1) && a17 <= 7) && 1 == a25)) || !(21 == u)) || !(22 == v)) || (((7 == a28 && !(a25 == 1)) && 8 == a17) && !(1 == a19))) || !(\old(a11) == 0)) || ((((7 <= a28 && a25 == 0) && a17 == 8) && a19 == 1) && a28 <= 9)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || (((a17 <= \old(a17) && !(a25 == 1)) && !(a11 == 1)) && 1 <= a19)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 89.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 60.8s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2299 SDtfs, 10701 SDslu, 2558 SDs, 0 SdLazy, 16607 SolverSat, 2569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1675 GetRequests, 1469 SyntacticMatches, 57 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5454occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.0s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9977817727295182 AbsIntWeakeningRatio, 0.17258883248730963 AbsIntAvgWeakeningVarsNumRemoved, 21.95939086294416 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 623 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 273 PreInvPairs, 543 NumberOfFragments, 1032 HoareAnnotationTreeSize, 273 FomulaSimplifications, 20947 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12188 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3198 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375038 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 1396/1533 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...