java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:07:20,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:07:20,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:07:20,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:07:20,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:07:20,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:07:20,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:07:20,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:07:20,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:07:20,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:07:20,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:07:20,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:07:20,270 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:07:20,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:07:20,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:07:20,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:07:20,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:07:20,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:07:20,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:07:20,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:07:20,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:07:20,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:07:20,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:07:20,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:07:20,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:07:20,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:07:20,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:07:20,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:07:20,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:07:20,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:07:20,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:07:20,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:07:20,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:07:20,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:07:20,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:07:20,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:07:20,301 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:07:20,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:07:20,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:07:20,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:07:20,318 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:07:20,318 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:07:20,318 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:07:20,318 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:07:20,319 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:07:20,319 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:07:20,319 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:07:20,319 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:07:20,319 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:07:20,319 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:07:20,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:07:20,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:07:20,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:07:20,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:07:20,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:07:20,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:07:20,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:07:20,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:07:20,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:07:20,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:07:20,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:07:20,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:07:20,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:07:20,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:07:20,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:07:20,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:07:20,323 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:07:20,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:07:20,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:07:20,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:07:20,324 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:07:20,324 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:07:20,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:07:20,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:07:20,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:07:20,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:07:20,388 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:07:20,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-12 17:07:20,445 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2d79ee9/9ab85b8bd4154db4a1a6d3b389c1a372/FLAG420a42830 [2018-11-12 17:07:21,048 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:07:21,049 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-12 17:07:21,060 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2d79ee9/9ab85b8bd4154db4a1a6d3b389c1a372/FLAG420a42830 [2018-11-12 17:07:21,078 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2d79ee9/9ab85b8bd4154db4a1a6d3b389c1a372 [2018-11-12 17:07:21,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:07:21,089 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:07:21,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:07:21,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:07:21,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:07:21,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a501ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21, skipping insertion in model container [2018-11-12 17:07:21,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:07:21,166 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:07:21,593 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:07:21,605 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:07:21,757 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:07:21,783 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:07:21,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21 WrapperNode [2018-11-12 17:07:21,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:07:21,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:07:21,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:07:21,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:07:21,794 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:07:21" (1/1) ... [2018-11-12 17:07:21,906 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:07:21" (1/1) ... [2018-11-12 17:07:21,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:07:21,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:07:21,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:07:21,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:07:21,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:21,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:22,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (1/1) ... [2018-11-12 17:07:22,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:07:22,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:07:22,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:07:22,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:07:22,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (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:07:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:07:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:07:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:07:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:07:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:07:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:07:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:07:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:07:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:07:25,326 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:07:25,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:25 BoogieIcfgContainer [2018-11-12 17:07:25,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:07:25,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:07:25,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:07:25,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:07:25,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:07:21" (1/3) ... [2018-11-12 17:07:25,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c28322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:07:25, skipping insertion in model container [2018-11-12 17:07:25,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:21" (2/3) ... [2018-11-12 17:07:25,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c28322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:07:25, skipping insertion in model container [2018-11-12 17:07:25,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:25" (3/3) ... [2018-11-12 17:07:25,336 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-11-12 17:07:25,345 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:07:25,355 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:07:25,375 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:07:25,417 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:07:25,417 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:07:25,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:07:25,418 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:07:25,418 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:07:25,419 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:07:25,419 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:07:25,419 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:07:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:07:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-12 17:07:25,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:25,469 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] [2018-11-12 17:07:25,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:25,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-11-12 17:07:25,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:25,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:25,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:25,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:25,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:26,101 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:07:26,204 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:07:26,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:07:26,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:07:26,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:26,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:07:26,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:07:26,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:07:26,237 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:07:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:27,884 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:07:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:07:27,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-12 17:07:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:27,907 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:07:27,907 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:07:27,914 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:07:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:07:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:07:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:07:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-12 17:07:27,988 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-11-12 17:07:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:27,990 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-12 17:07:27,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:07:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-12 17:07:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 17:07:27,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:27,999 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:27,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:27,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:28,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-11-12 17:07:28,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:28,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:28,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:28,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:28,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:07:28,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:07:28,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:28,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:07:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:07:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:07:28,253 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-12 17:07:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:30,113 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-12 17:07:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:07:30,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-12 17:07:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:30,120 INFO L225 Difference]: With dead ends: 888 [2018-11-12 17:07:30,121 INFO L226 Difference]: Without dead ends: 554 [2018-11-12 17:07:30,127 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:07:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-12 17:07:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-12 17:07:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-12 17:07:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-12 17:07:30,167 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-11-12 17:07:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:30,168 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-12 17:07:30,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:07:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-12 17:07:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-12 17:07:30,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:30,179 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:30,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:30,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-11-12 17:07:30,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:30,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:30,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:30,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:30,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:07:30,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:07:30,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:30,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:07:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:07:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:07:30,771 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-12 17:07:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:32,341 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-12 17:07:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:07:32,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-11-12 17:07:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:32,352 INFO L225 Difference]: With dead ends: 1210 [2018-11-12 17:07:32,352 INFO L226 Difference]: Without dead ends: 536 [2018-11-12 17:07:32,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 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:07:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-12 17:07:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-12 17:07:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-12 17:07:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-12 17:07:32,397 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-11-12 17:07:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:32,398 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-12 17:07:32,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:07:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-12 17:07:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 17:07:32,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:32,403 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:07:32,403 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:32,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-11-12 17:07:32,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:32,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:32,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:32,983 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-12 17:07:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:33,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:07:33,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:07:33,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:33,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:07:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:07:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:07:33,116 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-12 17:07:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:35,356 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-12 17:07:35,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:07:35,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-12 17:07:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:35,363 INFO L225 Difference]: With dead ends: 1204 [2018-11-12 17:07:35,363 INFO L226 Difference]: Without dead ends: 535 [2018-11-12 17:07:35,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:07:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-12 17:07:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-12 17:07:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-12 17:07:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-12 17:07:35,388 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-11-12 17:07:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:35,388 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-12 17:07:35,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:07:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-12 17:07:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 17:07:35,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:35,392 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:35,392 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:35,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-11-12 17:07:35,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:35,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:35,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:35,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:35,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:07:35,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:07:35,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:07:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:07:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:07:35,578 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-12 17:07:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:36,532 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-12 17:07:36,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:07:36,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-12 17:07:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:36,545 INFO L225 Difference]: With dead ends: 1521 [2018-11-12 17:07:36,545 INFO L226 Difference]: Without dead ends: 992 [2018-11-12 17:07:36,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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:07:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-12 17:07:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-12 17:07:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-12 17:07:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-12 17:07:36,590 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-11-12 17:07:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:36,590 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-12 17:07:36,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:07:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-12 17:07:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-12 17:07:36,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:36,596 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:07:36,596 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:36,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-11-12 17:07:36,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:36,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:36,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:07:36,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:07:36,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:36,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:07:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:07:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:07:36,779 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-12 17:07:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:38,058 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-12 17:07:38,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:07:38,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-12 17:07:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:38,072 INFO L225 Difference]: With dead ends: 2947 [2018-11-12 17:07:38,072 INFO L226 Difference]: Without dead ends: 1961 [2018-11-12 17:07:38,079 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:07:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-12 17:07:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-12 17:07:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-12 17:07:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-12 17:07:38,142 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-11-12 17:07:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:38,142 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-12 17:07:38,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:07:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-12 17:07:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-12 17:07:38,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:38,150 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:38,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:38,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-11-12 17:07:38,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:38,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:38,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:38,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:38,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:38,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:38,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:07:38,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-12 17:07:38,397 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:07:38,454 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:07:38,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:07:39,195 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:07:39,197 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Performed 883 root evaluator evaluations with a maximum evaluation depth of 6. Performed 883 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 42 variables. [2018-11-12 17:07:39,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:39,245 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:07:39,815 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 79.59% of their original sizes. [2018-11-12 17:07:39,816 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:07:41,060 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-12 17:07:41,063 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:07:41,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:07:41,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-12 17:07:41,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:41,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:07:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:07:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:07:41,066 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-11-12 17:07:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:49,039 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-11-12 17:07:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:07:49,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-11-12 17:07:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:49,051 INFO L225 Difference]: With dead ends: 3911 [2018-11-12 17:07:49,051 INFO L226 Difference]: Without dead ends: 1989 [2018-11-12 17:07:49,058 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:07:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-11-12 17:07:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-11-12 17:07:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-11-12 17:07:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-11-12 17:07:49,214 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 151 [2018-11-12 17:07:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:49,215 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-11-12 17:07:49,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:07:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-11-12 17:07:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-12 17:07:49,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:49,225 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:49,225 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:49,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-11-12 17:07:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:49,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:07:49,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:49,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:07:49,559 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-12 17:07:49,559 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:07:49,565 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:07:49,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:07:50,389 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:07:50,391 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Performed 2985 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2985 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:07:50,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:50,428 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:07:51,184 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 81.38% of their original sizes. [2018-11-12 17:07:51,184 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:07:52,872 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-12 17:07:52,873 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:07:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:07:52,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:07:52,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:52,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:07:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:07:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:07:52,874 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 18 states. [2018-11-12 17:08:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:06,919 INFO L93 Difference]: Finished difference Result 4196 states and 5533 transitions. [2018-11-12 17:08:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:08:06,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 160 [2018-11-12 17:08:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:06,930 INFO L225 Difference]: With dead ends: 4196 [2018-11-12 17:08:06,931 INFO L226 Difference]: Without dead ends: 2274 [2018-11-12 17:08:06,937 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-12 17:08:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2018-11-12 17:08:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2263. [2018-11-12 17:08:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-11-12 17:08:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2914 transitions. [2018-11-12 17:08:07,006 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2914 transitions. Word has length 160 [2018-11-12 17:08:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:07,007 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 2914 transitions. [2018-11-12 17:08:07,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:08:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2914 transitions. [2018-11-12 17:08:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-12 17:08:07,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:07,016 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:08:07,016 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:07,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:07,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-11-12 17:08:07,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:07,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:07,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:07,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:07,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:07,521 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:08:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-12 17:08:07,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:07,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:07,672 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-11-12 17:08:07,673 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:07,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:07,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:08,028 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:08:08,028 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Performed 3032 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3032 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:08:08,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:08,032 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:08:08,915 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 81.09% of their original sizes. [2018-11-12 17:08:08,916 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:08:11,228 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-11-12 17:08:11,228 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:08:11,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:08:11,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-12 17:08:11,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:11,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 17:08:11,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 17:08:11,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:08:11,231 INFO L87 Difference]: Start difference. First operand 2263 states and 2914 transitions. Second operand 23 states. [2018-11-12 17:08:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:32,453 INFO L93 Difference]: Finished difference Result 4605 states and 5974 transitions. [2018-11-12 17:08:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:08:32,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 193 [2018-11-12 17:08:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:32,464 INFO L225 Difference]: With dead ends: 4605 [2018-11-12 17:08:32,465 INFO L226 Difference]: Without dead ends: 2683 [2018-11-12 17:08:32,471 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 165 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:08:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-11-12 17:08:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2401. [2018-11-12 17:08:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-11-12 17:08:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3057 transitions. [2018-11-12 17:08:32,533 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3057 transitions. Word has length 193 [2018-11-12 17:08:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:32,534 INFO L480 AbstractCegarLoop]: Abstraction has 2401 states and 3057 transitions. [2018-11-12 17:08:32,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 17:08:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3057 transitions. [2018-11-12 17:08:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-12 17:08:32,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:32,543 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:08:32,544 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:32,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-11-12 17:08:32,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:32,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:32,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:32,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:32,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:08:33,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:33,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:33,329 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-12 17:08:33,329 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:33,339 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:33,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:35,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:08:35,337 INFO L272 AbstractInterpreter]: Visited 123 different actions 684 times. Merged at 9 different actions 53 times. Widened at 1 different actions 1 times. Performed 10663 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:08:35,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:35,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:08:35,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:35,345 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:08:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:35,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:08:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:35,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:08:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-12 17:08:35,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:08:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:08:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:08:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:08:36,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:08:36,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:08:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:08:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:08:36,135 INFO L87 Difference]: Start difference. First operand 2401 states and 3057 transitions. Second operand 11 states. [2018-11-12 17:08:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:39,930 INFO L93 Difference]: Finished difference Result 8864 states and 12047 transitions. [2018-11-12 17:08:39,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 17:08:39,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-11-12 17:08:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:39,966 INFO L225 Difference]: With dead ends: 8864 [2018-11-12 17:08:39,966 INFO L226 Difference]: Without dead ends: 6668 [2018-11-12 17:08:39,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:08:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2018-11-12 17:08:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6461. [2018-11-12 17:08:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6461 states. [2018-11-12 17:08:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 8219 transitions. [2018-11-12 17:08:40,173 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 8219 transitions. Word has length 202 [2018-11-12 17:08:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:40,176 INFO L480 AbstractCegarLoop]: Abstraction has 6461 states and 8219 transitions. [2018-11-12 17:08:40,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:08:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 8219 transitions. [2018-11-12 17:08:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-12 17:08:40,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:40,196 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:08:40,196 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:40,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:40,196 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-11-12 17:08:40,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:40,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:40,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:08:40,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:40,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:40,652 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-12 17:08:40,652 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:40,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:40,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:41,164 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:08:41,164 INFO L272 AbstractInterpreter]: Visited 122 different actions 310 times. Merged at 7 different actions 14 times. Never widened. Performed 4570 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4570 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:08:41,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:41,171 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:08:41,499 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 80.36% of their original sizes. [2018-11-12 17:08:41,499 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:08:41,588 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-12 17:08:41,588 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:08:41,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:08:41,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:08:41,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:41,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:08:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:08:41,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:08:41,590 INFO L87 Difference]: Start difference. First operand 6461 states and 8219 transitions. Second operand 11 states. [2018-11-12 17:08:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:48,520 INFO L93 Difference]: Finished difference Result 12860 states and 16425 transitions. [2018-11-12 17:08:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:08:48,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-11-12 17:08:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:48,549 INFO L225 Difference]: With dead ends: 12860 [2018-11-12 17:08:48,549 INFO L226 Difference]: Without dead ends: 6742 [2018-11-12 17:08:48,567 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:08:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-12 17:08:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6737. [2018-11-12 17:08:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6737 states. [2018-11-12 17:08:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 8515 transitions. [2018-11-12 17:08:48,738 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 8515 transitions. Word has length 211 [2018-11-12 17:08:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:48,738 INFO L480 AbstractCegarLoop]: Abstraction has 6737 states and 8515 transitions. [2018-11-12 17:08:48,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:08:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 8515 transitions. [2018-11-12 17:08:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-12 17:08:48,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:48,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:08:48,758 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:48,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash 310011569, now seen corresponding path program 1 times [2018-11-12 17:08:48,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:48,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:48,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:48,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:49,291 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:08:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-12 17:08:49,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:49,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:49,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-12 17:08:49,475 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:49,477 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:49,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:49,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:08:49,863 INFO L272 AbstractInterpreter]: Visited 121 different actions 190 times. Merged at 5 different actions 7 times. Never widened. Performed 2994 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2994 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:08:49,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:49,869 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:08:50,278 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 80.15% of their original sizes. [2018-11-12 17:08:50,278 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:08:50,956 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-12 17:08:50,957 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:08:50,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:08:50,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:08:50,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:50,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:08:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:08:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:08:50,959 INFO L87 Difference]: Start difference. First operand 6737 states and 8515 transitions. Second operand 18 states. [2018-11-12 17:08:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:59,336 INFO L93 Difference]: Finished difference Result 12994 states and 16539 transitions. [2018-11-12 17:08:59,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:08:59,336 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 215 [2018-11-12 17:08:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:59,362 INFO L225 Difference]: With dead ends: 12994 [2018-11-12 17:08:59,363 INFO L226 Difference]: Without dead ends: 6876 [2018-11-12 17:08:59,381 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:08:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6876 states. [2018-11-12 17:08:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6876 to 6875. [2018-11-12 17:08:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-11-12 17:08:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 8654 transitions. [2018-11-12 17:08:59,537 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 8654 transitions. Word has length 215 [2018-11-12 17:08:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:59,538 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 8654 transitions. [2018-11-12 17:08:59,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:08:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 8654 transitions. [2018-11-12 17:08:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-12 17:08:59,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:59,558 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:08:59,558 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:59,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-11-12 17:08:59,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:59,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:00,071 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 17:09:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 17:09:00,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:00,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:00,105 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-12 17:09:00,105 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:00,108 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:00,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:01,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:09:01,077 INFO L272 AbstractInterpreter]: Visited 123 different actions 438 times. Merged at 9 different actions 30 times. Never widened. Performed 6730 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6730 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:09:01,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:01,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:09:01,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:01,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:09:01,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:01,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:09:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:01,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:09:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:09:01,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:09:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:09:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:09:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-12 17:09:01,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:09:01,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:09:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:09:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:01,616 INFO L87 Difference]: Start difference. First operand 6875 states and 8654 transitions. Second operand 8 states. [2018-11-12 17:09:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:04,093 INFO L93 Difference]: Finished difference Result 14080 states and 18213 transitions. [2018-11-12 17:09:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 17:09:04,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-11-12 17:09:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:04,120 INFO L225 Difference]: With dead ends: 14080 [2018-11-12 17:09:04,121 INFO L226 Difference]: Without dead ends: 7962 [2018-11-12 17:09:04,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:09:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2018-11-12 17:09:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7511. [2018-11-12 17:09:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7511 states. [2018-11-12 17:09:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 9045 transitions. [2018-11-12 17:09:04,309 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 9045 transitions. Word has length 227 [2018-11-12 17:09:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:04,310 INFO L480 AbstractCegarLoop]: Abstraction has 7511 states and 9045 transitions. [2018-11-12 17:09:04,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:09:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 9045 transitions. [2018-11-12 17:09:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-12 17:09:04,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:04,332 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-12 17:09:04,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:04,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-11-12 17:09:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:04,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-12 17:09:04,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:04,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:04,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-12 17:09:04,774 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:04,777 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:04,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:05,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:09:05,724 INFO L272 AbstractInterpreter]: Visited 123 different actions 436 times. Merged at 8 different actions 28 times. Never widened. Performed 6536 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6536 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:09:05,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:05,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:09:05,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:05,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:09:05,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:05,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:09:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:05,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:09:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-12 17:09:05,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:09:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-12 17:09:06,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:09:06,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-12 17:09:06,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:09:06,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:09:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:09:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:09:06,178 INFO L87 Difference]: Start difference. First operand 7511 states and 9045 transitions. Second operand 12 states. [2018-11-12 17:09:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:10,801 INFO L93 Difference]: Finished difference Result 14177 states and 18479 transitions. [2018-11-12 17:09:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 17:09:10,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-11-12 17:09:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:10,802 INFO L225 Difference]: With dead ends: 14177 [2018-11-12 17:09:10,802 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:09:10,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 17:09:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:09:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:09:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:09:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:09:10,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-12 17:09:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:10,842 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:09:10,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:09:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:09:10,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:09:10,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:09:11,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:11,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,057 WARN L179 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 288 [2018-11-12 17:09:12,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:12,851 WARN L179 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 303 [2018-11-12 17:09:13,379 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-11-12 17:09:15,522 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2018-11-12 17:09:21,638 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 321 DAG size of output: 174 [2018-11-12 17:09:23,480 WARN L179 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 310 DAG size of output: 110 [2018-11-12 17:09:25,850 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 326 DAG size of output: 110 [2018-11-12 17:09:25,854 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:09:25,854 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-11-12 17:09:25,854 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:09:25,854 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:09:25,854 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:09:25,855 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:09:25,856 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:09:25,857 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,858 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:09:25,859 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:09:25,860 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:09:25,861 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:09:25,862 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,863 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:09:25,864 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,865 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:09:25,866 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:09:25,867 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse21 (= ~a8~0 15)) (.cse20 (= ~a21~0 1)) (.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|))) (let ((.cse3 (< 0 |old(~a21~0)|)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse17 (< |calculate_output_#in~input| 1)) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (= ~a16~0 |old(~a16~0)|) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 |old(~a20~0)|))) (.cse18 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse7 (= 1 |old(~a7~0)|)) (.cse8 (not .cse5)) (.cse22 (= 1 ~a20~0)) (.cse23 (= 13 ~a8~0)) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse25 (= 1 ~a21~0)) (.cse26 (= 1 ~a17~0)) (.cse27 (not (= 13 |old(~a8~0)|))) (.cse16 (not .cse6)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse12 (not (= 1 |old(~a21~0)|))) (.cse19 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse14 (not (= 0 |old(~a17~0)|))) (.cse2 (not (= 8 ~a12~0))) (.cse10 (and .cse21 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 (< |old(~a20~0)| 1) .cse6 .cse3) (or .cse7 .cse8 .cse1 .cse2 .cse6) (or .cse9 .cse10 (let ((.cse15 (not (= 5 |old(~a16~0)|)))) (and (or .cse11 .cse12 .cse13 .cse14 (not (= 0 |old(~a20~0)|)) .cse15 .cse2) (or .cse11 .cse12 .cse13 .cse15 .cse2 (< |old(~a20~0)| 0) .cse16))) .cse4 .cse17) (or .cse0 .cse5 .cse18 .cse2 .cse6 .cse1) (or .cse0 .cse7 .cse1 .cse18 .cse2) (or .cse1 (or .cse0 .cse19 .cse2 .cse3)) (or .cse7 .cse18 .cse2 .cse1 .cse4) (or .cse7 .cse1 .cse5 .cse19 .cse2 .cse16) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse20 .cse21) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse17 .cse11 .cse9 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse9 (or .cse11 .cse12) .cse10 .cse2 (< 1 |old(~a17~0)|) .cse19 .cse13 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) (< |old(~a17~0)| 0) .cse6 .cse17) (or .cse12 .cse19 .cse8 (and (= 1 ~a7~0) .cse22 .cse23 .cse24 .cse25 .cse26) .cse2 (not .cse7) .cse27 .cse16) (or .cse7 .cse18 .cse2 .cse6 .cse1) (or .cse0 .cse1 .cse18 .cse2 .cse6 .cse4) (or .cse12 .cse7 .cse19 .cse8 .cse2 (and (not (= ~a7~0 1)) .cse22 .cse23 .cse24 .cse25 .cse26) .cse27 .cse16) (or (or .cse11 .cse12 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse19 .cse13 .cse14 .cse2) .cse10)))) [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,868 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:09:25,869 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,870 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:09:25,871 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:09:25,872 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:09:25,873 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:09:25,873 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:09:25,873 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:09:25,873 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:09:25,873 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-12 17:09:25,873 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:09:25,873 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:09:25,873 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:09:25,873 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:09:25,874 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-12 17:09:25,874 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:09:25,874 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:09:25,874 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:09:25,874 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-12 17:09:25,874 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:09:25,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:09:25 BoogieIcfgContainer [2018-11-12 17:09:25,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:09:25,890 INFO L168 Benchmark]: Toolchain (without parser) took 124801.02 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:09:25,891 INFO L168 Benchmark]: CDTParser took 0.25 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:09:25,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.79 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:09:25,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:25,896 INFO L168 Benchmark]: Boogie Preprocessor took 113.56 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:25,897 INFO L168 Benchmark]: RCFGBuilder took 3298.53 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: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:25,897 INFO L168 Benchmark]: TraceAbstraction took 120560.59 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -543.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:09:25,905 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.25 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 694.79 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 129.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.56 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3298.53 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: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120560.59 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -543.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && !(a17 == 1)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || !(21 == u)) || !(22 == v)) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 120.4s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 79.4s AutomataDifference, 0.0s DeadEndRemovalTime, 15.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2048 SDtfs, 12622 SDslu, 2719 SDs, 0 SdLazy, 17399 SolverSat, 2308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2501 GetRequests, 2243 SyntacticMatches, 23 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7511occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.9s AbstIntTime, 8 AbstIntIterations, 5 AbstIntStrong, 0.9971292228339744 AbsIntWeakeningRatio, 0.22162162162162163 AbsIntAvgWeakeningVarsNumRemoved, 22.79027027027027 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1005 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 358 PreInvPairs, 626 NumberOfFragments, 1344 HoareAnnotationTreeSize, 358 FomulaSimplifications, 22848 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18876 FormulaSimplificationTreeSizeReductionInter, 12.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3704 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005031 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 2336/2540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...