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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 15:58:02,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:58:02,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:58:02,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:58:02,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:58:02,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:58:02,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:58:02,346 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:58:02,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:58:02,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:58:02,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:58:02,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:58:02,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:58:02,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:58:02,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:58:02,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:58:02,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:58:02,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:58:02,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:58:02,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:58:02,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:58:02,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:58:02,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:58:02,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:58:02,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:58:02,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:58:02,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:58:02,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:58:02,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:58:02,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:58:02,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:58:02,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:58:02,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:58:02,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:58:02,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:58:02,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:58:02,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 15:58:02,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:58:02,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:58:02,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:58:02,423 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:58:02,423 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:58:02,424 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:58:02,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:58:02,424 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:58:02,424 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:58:02,425 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:58:02,425 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:58:02,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:58:02,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:58:02,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:58:02,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:58:02,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:58:02,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:58:02,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:58:02,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:58:02,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:58:02,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:58:02,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:58:02,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:58:02,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:58:02,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:58:02,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:58:02,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:58:02,429 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:58:02,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:58:02,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:58:02,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:58:02,430 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:58:02,430 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:58:02,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:58:02,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:58:02,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:58:02,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:58:02,504 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:58:02,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-09-14 15:58:02,849 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e8cb477/ea896cf630994557a5f5d06a048a96bb/FLAG3bd031743 [2018-09-14 15:58:03,125 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:58:03,126 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-09-14 15:58:03,152 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e8cb477/ea896cf630994557a5f5d06a048a96bb/FLAG3bd031743 [2018-09-14 15:58:03,176 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e8cb477/ea896cf630994557a5f5d06a048a96bb [2018-09-14 15:58:03,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:58:03,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:58:03,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:58:03,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:58:03,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:58:03,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:03,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c5c827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03, skipping insertion in model container [2018-09-14 15:58:03,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:03,215 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:58:03,737 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:58:03,760 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:58:03,894 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:58:03,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03 WrapperNode [2018-09-14 15:58:03,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:58:03,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:58:03,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:58:03,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:58:03,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:03,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:58:04,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:58:04,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:58:04,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:58:04,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (1/1) ... [2018-09-14 15:58:04,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:58:04,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:58:04,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:58:04,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:58:04,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (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-09-14 15:58:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:58:04,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:58:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 15:58:04,311 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 15:58:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:58:04,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:58:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:58:04,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:58:07,471 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:58:07,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:58:07 BoogieIcfgContainer [2018-09-14 15:58:07,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:58:07,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:58:07,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:58:07,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:58:07,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:58:03" (1/3) ... [2018-09-14 15:58:07,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c97f18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:58:07, skipping insertion in model container [2018-09-14 15:58:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:58:03" (2/3) ... [2018-09-14 15:58:07,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c97f18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:58:07, skipping insertion in model container [2018-09-14 15:58:07,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:58:07" (3/3) ... [2018-09-14 15:58:07,481 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-09-14 15:58:07,491 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:58:07,501 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:58:07,565 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:58:07,566 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:58:07,566 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:58:07,566 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:58:07,566 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:58:07,566 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:58:07,569 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:58:07,569 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:58:07,569 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:58:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-14 15:58:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-14 15:58:07,614 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:07,615 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:07,617 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-09-14 15:58:07,624 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:07,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:07,672 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:08,327 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:08,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 15:58:08,327 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:08,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:58:08,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:58:08,356 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:58:08,359 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-14 15:58:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:10,057 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-09-14 15:58:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 15:58:10,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-09-14 15:58:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:10,080 INFO L225 Difference]: With dead ends: 621 [2018-09-14 15:58:10,081 INFO L226 Difference]: Without dead ends: 382 [2018-09-14 15:58:10,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:58:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-14 15:58:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-14 15:58:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-14 15:58:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-09-14 15:58:10,172 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-09-14 15:58:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:10,173 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-09-14 15:58:10,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 15:58:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-09-14 15:58:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-14 15:58:10,181 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:10,181 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:10,182 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-09-14 15:58:10,182 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:10,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:10,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:10,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:10,184 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:10,616 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:10,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:58:10,617 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:10,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:58:10,620 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:58:10,621 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:10,621 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-09-14 15:58:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:12,288 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-09-14 15:58:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:58:12,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-09-14 15:58:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:12,293 INFO L225 Difference]: With dead ends: 903 [2018-09-14 15:58:12,293 INFO L226 Difference]: Without dead ends: 381 [2018-09-14 15:58:12,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-14 15:58:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-14 15:58:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-14 15:58:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-09-14 15:58:12,326 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-09-14 15:58:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:12,327 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-09-14 15:58:12,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:58:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-09-14 15:58:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-14 15:58:12,331 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:12,331 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:12,332 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-09-14 15:58:12,332 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:12,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:12,334 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:13,133 WARN L178 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-09-14 15:58:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:13,365 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:13,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:58:13,365 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:13,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:58:13,369 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:58:13,369 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:13,369 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-09-14 15:58:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:14,984 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-09-14 15:58:14,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:58:14,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-09-14 15:58:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:14,991 INFO L225 Difference]: With dead ends: 901 [2018-09-14 15:58:14,991 INFO L226 Difference]: Without dead ends: 380 [2018-09-14 15:58:14,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-14 15:58:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-09-14 15:58:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-14 15:58:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-09-14 15:58:15,023 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-09-14 15:58:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:15,024 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-09-14 15:58:15,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:58:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-09-14 15:58:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-14 15:58:15,027 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:15,027 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:15,028 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-09-14 15:58:15,028 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:15,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:15,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:15,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:15,030 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:15,280 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 15:58:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:15,381 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:15,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 15:58:15,382 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:15,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:58:15,383 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:58:15,383 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 15:58:15,383 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-09-14 15:58:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:18,545 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-09-14 15:58:18,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:58:18,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-09-14 15:58:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:18,554 INFO L225 Difference]: With dead ends: 1193 [2018-09-14 15:58:18,555 INFO L226 Difference]: Without dead ends: 819 [2018-09-14 15:58:18,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 15:58:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-14 15:58:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-09-14 15:58:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-09-14 15:58:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-09-14 15:58:18,605 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-09-14 15:58:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:18,605 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-09-14 15:58:18,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:58:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-09-14 15:58:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-14 15:58:18,610 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:18,610 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:18,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:18,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-09-14 15:58:18,611 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:18,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:18,613 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:18,936 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-14 15:58:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:19,006 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:19,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:58:19,006 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:19,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:58:19,007 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:58:19,007 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:19,007 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-09-14 15:58:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:20,302 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-09-14 15:58:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:58:20,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-09-14 15:58:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:20,311 INFO L225 Difference]: With dead ends: 1753 [2018-09-14 15:58:20,312 INFO L226 Difference]: Without dead ends: 804 [2018-09-14 15:58:20,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-09-14 15:58:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-09-14 15:58:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-09-14 15:58:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-09-14 15:58:20,351 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-09-14 15:58:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:20,352 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-09-14 15:58:20,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:58:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-09-14 15:58:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-14 15:58:20,358 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:20,358 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:20,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-09-14 15:58:20,359 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:20,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:20,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:20,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:20,360 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:20,711 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:20,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:58:20,711 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:20,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:58:20,712 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:58:20,712 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:20,712 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-09-14 15:58:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:22,256 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-09-14 15:58:22,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:58:22,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-09-14 15:58:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:22,262 INFO L225 Difference]: With dead ends: 1747 [2018-09-14 15:58:22,262 INFO L226 Difference]: Without dead ends: 801 [2018-09-14 15:58:22,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:58:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-09-14 15:58:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-09-14 15:58:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-09-14 15:58:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-09-14 15:58:22,299 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-09-14 15:58:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:22,300 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-09-14 15:58:22,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:58:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-09-14 15:58:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-14 15:58:22,304 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:22,305 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:22,305 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-09-14 15:58:22,305 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:22,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:22,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:22,307 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:22,522 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 15:58:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:22,912 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:58:22,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 15:58:22,913 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:22,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:58:22,914 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:58:22,914 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 15:58:22,914 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-09-14 15:58:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:24,236 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-09-14 15:58:24,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:58:24,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-09-14 15:58:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:24,252 INFO L225 Difference]: With dead ends: 2381 [2018-09-14 15:58:24,252 INFO L226 Difference]: Without dead ends: 1586 [2018-09-14 15:58:24,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 15:58:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-09-14 15:58:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-09-14 15:58:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-09-14 15:58:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-09-14 15:58:24,319 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-09-14 15:58:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:24,320 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-09-14 15:58:24,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:58:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-09-14 15:58:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-14 15:58:24,327 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:24,328 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:24,328 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-09-14 15:58:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:24,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:24,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:24,330 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:25,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:25,022 INFO L197 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-09-14 15:58:25,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:25,032 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:25,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 15:58:25,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 15:58:25,648 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:58:25,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-09-14 15:58:25,649 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:25,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:58:25,649 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:58:25,650 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-14 15:58:25,650 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-09-14 15:58:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:27,881 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-09-14 15:58:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 15:58:27,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-09-14 15:58:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:27,898 INFO L225 Difference]: With dead ends: 4565 [2018-09-14 15:58:27,898 INFO L226 Difference]: Without dead ends: 3013 [2018-09-14 15:58:27,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-14 15:58:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-09-14 15:58:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-09-14 15:58:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-09-14 15:58:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-09-14 15:58:28,005 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 184 [2018-09-14 15:58:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:28,006 INFO L480 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-09-14 15:58:28,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 15:58:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-09-14 15:58:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-14 15:58:28,019 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:28,021 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:28,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2112487449, now seen corresponding path program 1 times [2018-09-14 15:58:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:28,023 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:28,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:28,503 INFO L197 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) [2018-09-14 15:58:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:28,520 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:58:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:28,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-14 15:58:28,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-14 15:58:28,905 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:58:28,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-14 15:58:28,906 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:58:28,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:58:28,907 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:58:28,907 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-14 15:58:28,907 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 3 states. [2018-09-14 15:58:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:29,700 INFO L93 Difference]: Finished difference Result 6949 states and 9284 transitions. [2018-09-14 15:58:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 15:58:29,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-14 15:58:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:29,722 INFO L225 Difference]: With dead ends: 6949 [2018-09-14 15:58:29,723 INFO L226 Difference]: Without dead ends: 3947 [2018-09-14 15:58:29,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-14 15:58:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2018-09-14 15:58:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3942. [2018-09-14 15:58:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2018-09-14 15:58:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4805 transitions. [2018-09-14 15:58:29,831 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4805 transitions. Word has length 213 [2018-09-14 15:58:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:29,832 INFO L480 AbstractCegarLoop]: Abstraction has 3942 states and 4805 transitions. [2018-09-14 15:58:29,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 15:58:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4805 transitions. [2018-09-14 15:58:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-14 15:58:29,846 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:29,847 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:29,847 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -956666631, now seen corresponding path program 1 times [2018-09-14 15:58:29,847 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:29,849 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:30,050 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:30,050 INFO L197 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-09-14 15:58:30,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:30,059 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:30,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:30,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:30,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:30,369 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:58:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:30,385 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:30,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 74 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:30,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:30,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:58:30,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 8] total 12 [2018-09-14 15:58:30,970 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:58:30,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:58:30,971 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:58:30,971 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-14 15:58:30,971 INFO L87 Difference]: Start difference. First operand 3942 states and 4805 transitions. Second operand 6 states. [2018-09-14 15:58:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:32,160 INFO L93 Difference]: Finished difference Result 7851 states and 9707 transitions. [2018-09-14 15:58:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:58:32,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2018-09-14 15:58:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:32,182 INFO L225 Difference]: With dead ends: 7851 [2018-09-14 15:58:32,182 INFO L226 Difference]: Without dead ends: 3915 [2018-09-14 15:58:32,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 902 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-14 15:58:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-09-14 15:58:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3718. [2018-09-14 15:58:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2018-09-14 15:58:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 4310 transitions. [2018-09-14 15:58:32,287 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 4310 transitions. Word has length 228 [2018-09-14 15:58:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:32,288 INFO L480 AbstractCegarLoop]: Abstraction has 3718 states and 4310 transitions. [2018-09-14 15:58:32,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:58:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4310 transitions. [2018-09-14 15:58:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-14 15:58:32,302 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:32,302 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:58:32,302 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1111459177, now seen corresponding path program 1 times [2018-09-14 15:58:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:32,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:32,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:32,304 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:32,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:32,549 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:58:32,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:32,559 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:32,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 15:58:32,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 15:58:33,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:33,365 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:58:33,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:33,381 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:33,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 15:58:33,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 15:58:33,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:58:33,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 5, 5] total 16 [2018-09-14 15:58:33,800 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:58:33,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 15:58:33,801 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 15:58:33,801 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-09-14 15:58:33,802 INFO L87 Difference]: Start difference. First operand 3718 states and 4310 transitions. Second operand 15 states. [2018-09-14 15:58:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:37,421 INFO L93 Difference]: Finished difference Result 8829 states and 10803 transitions. [2018-09-14 15:58:37,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-14 15:58:37,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-09-14 15:58:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:37,439 INFO L225 Difference]: With dead ends: 8829 [2018-09-14 15:58:37,439 INFO L226 Difference]: Without dead ends: 2879 [2018-09-14 15:58:37,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1020 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2018-09-14 15:58:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2018-09-14 15:58:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2687. [2018-09-14 15:58:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2018-09-14 15:58:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3126 transitions. [2018-09-14 15:58:37,558 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3126 transitions. Word has length 255 [2018-09-14 15:58:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:37,559 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 3126 transitions. [2018-09-14 15:58:37,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-14 15:58:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3126 transitions. [2018-09-14 15:58:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-09-14 15:58:37,576 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:58:37,577 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 15:58:37,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:58:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash 641913708, now seen corresponding path program 1 times [2018-09-14 15:58:37,577 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:58:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:58:37,579 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:58:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:38,531 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-14 15:58:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:38,669 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:38,669 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:58:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:38,678 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:38,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-14 15:58:39,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-14 15:58:39,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:58:39,597 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:58:39,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:58:39,614 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:58:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:58:39,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:58:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 281 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:40,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:58:40,271 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-14 15:58:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 246 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:58:40,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:58:40,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 8, 8] total 20 [2018-09-14 15:58:40,745 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:58:40,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 15:58:40,746 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 15:58:40,746 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-09-14 15:58:40,746 INFO L87 Difference]: Start difference. First operand 2687 states and 3126 transitions. Second operand 13 states. [2018-09-14 15:58:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:58:44,966 INFO L93 Difference]: Finished difference Result 5552 states and 6595 transitions. [2018-09-14 15:58:44,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-14 15:58:44,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-09-14 15:58:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:58:44,976 INFO L225 Difference]: With dead ends: 5552 [2018-09-14 15:58:44,976 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 15:58:45,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1257 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2018-09-14 15:58:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 15:58:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 15:58:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 15:58:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 15:58:45,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2018-09-14 15:58:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:58:45,002 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 15:58:45,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 15:58:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 15:58:45,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 15:58:45,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 15:58:45,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,368 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 117 [2018-09-14 15:58:45,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:58:45,529 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 117 [2018-09-14 15:58:45,706 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-14 15:58:46,140 WARN L178 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-09-14 15:58:48,135 WARN L178 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 151 DAG size of output: 88 [2018-09-14 15:58:49,144 WARN L178 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 69 [2018-09-14 15:58:50,287 WARN L178 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 118 DAG size of output: 69 [2018-09-14 15:58:50,290 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:58:50,290 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-09-14 15:58:50,290 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:58:50,290 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-14 15:58:50,291 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-14 15:58:50,292 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-14 15:58:50,293 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-14 15:58:50,294 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,295 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-14 15:58:50,296 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,297 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-14 15:58:50,298 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,299 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,300 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-14 15:58:50,301 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-14 15:58:50,302 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-14 15:58:50,303 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-14 15:58:50,304 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-14 15:58:50,305 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-14 15:58:50,306 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-14 15:58:50,306 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,306 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,306 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= 1 |old(~a19~0)|)) (.cse28 (= 7 ~a17~0)) (.cse22 (= |old(~a25~0)| ~a25~0)) (.cse29 (not (= ~a11~0 1))) (.cse2 (= |old(~a28~0)| ~a28~0)) (.cse3 (= ~a17~0 |old(~a17~0)|)) (.cse4 (= ~a19~0 |old(~a19~0)|)) (.cse5 (= ~a25~0 |old(~a25~0)|)) (.cse9 (= 1 |old(~a25~0)|)) (.cse10 (= 1 |old(~a11~0)|))) (let ((.cse16 (not (= 8 |old(~a17~0)|))) (.cse19 (= 8 ~a17~0)) (.cse15 (not (= 7 |old(~a28~0)|))) (.cse21 (not .cse10)) (.cse17 (= 7 ~a28~0)) (.cse18 (= 1 ~a11~0)) (.cse20 (= 1 ~a19~0)) (.cse23 (not (= 10 |old(~a28~0)|))) (.cse11 (not .cse9)) (.cse12 (and .cse29 .cse2 .cse3 .cse4 .cse5)) (.cse8 (not (= |old(~a17~0)| 8))) (.cse13 (and .cse2 .cse3 .cse4 .cse29 .cse5)) (.cse25 (< 0 |old(~a19~0)|)) (.cse26 (and .cse2 .cse28 .cse22 .cse4)) (.cse0 (not (= 1 ~a21~0))) (.cse1 (< 9 |old(~a28~0)|)) (.cse6 (not .cse14)) (.cse7 (= |old(~a17~0)| |old(~a28~0)|)) (.cse24 (= 9 |old(~a28~0)|)) (.cse27 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse11 .cse6 .cse8 .cse12) (or .cse0 .cse10 .cse13 .cse6 .cse7 .cse8) (or .cse14 .cse0 .cse15 .cse16 (and .cse17 (not (= ~a25~0 1)) .cse18 .cse19 (not .cse20)) .cse21 .cse9) (or (and .cse18 .cse19 .cse20 .cse22 (= 10 ~a28~0)) .cse0 .cse23 .cse11 .cse6 .cse16 .cse21) (or .cse0 .cse10 .cse1 .cse24 .cse8 .cse25 .cse13 .cse9) (or .cse0 .cse7 .cse26 .cse25 .cse9 .cse27) (or .cse0 .cse11 .cse6 .cse16 (and .cse18 (= 1 ~a25~0) (= 9 ~a28~0) .cse19 .cse20) (not .cse24) .cse21) (or .cse0 .cse15 .cse11 .cse6 .cse21 (and .cse17 .cse18 .cse28 .cse20 .cse22) .cse27) (or .cse0 .cse10 .cse23 .cse11 .cse12 .cse8 .cse25) (or .cse0 .cse1 .cse26 .cse7 .cse25 .cse27) (or .cse0 .cse10 .cse1 .cse7 .cse29 .cse25 .cse27) (or .cse0 .cse10 .cse1 .cse6 .cse7 .cse24 .cse9 .cse13) (or (or .cse0 .cse10 .cse1 .cse7 .cse24 .cse8 .cse25) .cse13) (or .cse0 .cse10 .cse6 (and .cse2 .cse28 .cse22 .cse4 .cse29) .cse7 .cse24 .cse9 .cse27) (or .cse0 .cse10 .cse7 .cse29 .cse25 .cse9 .cse27) (or .cse26 .cse0 .cse1 .cse6 .cse7 .cse24 .cse9 .cse27)))) [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-14 15:58:50,307 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-14 15:58:50,308 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-14 15:58:50,309 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-14 15:58:50,310 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-14 15:58:50,311 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-14 15:58:50,312 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-14 15:58:50,313 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:58:50,314 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a28~0 ~a17~0)) (not (= ~a25~0 1)) (= 1 ~a19~0) (= ~a21~0 1) (<= ~a28~0 9) (not (= ~a11~0 1)) (not (= ~a28~0 9))) [2018-09-14 15:58:50,314 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 15:58:50,314 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:58:50,314 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (< 9 |old(~a28~0)|) (not (= 1 |old(~a19~0)|)) (= |old(~a17~0)| |old(~a28~0)|) (= 9 |old(~a28~0)|) (= 1 |old(~a25~0)|) (and (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (not (= ~a11~0 1)) (= ~a25~0 |old(~a25~0)|))) [2018-09-14 15:58:50,314 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-14 15:58:50,315 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a25~0 1))) (let ((.cse14 (= |old(~a28~0)| ~a28~0)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse4 (<= ~a28~0 9)) (.cse9 (= 7 ~a28~0)) (.cse10 (= 1 ~a11~0)) (.cse13 (= 8 ~a17~0)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse16 (not .cse8)) (.cse11 (= 7 ~a17~0)) (.cse7 (= 1 ~a19~0)) (.cse6 (not (= ~a28~0 9))) (.cse0 (= |old(~a17~0)| 8)) (.cse1 (<= ~a19~0 0)) (.cse3 (= |old(~a17~0)| ~a17~0)) (.cse12 (= 1 ~a25~0)) (.cse17 (= 10 ~a28~0)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= 1 ~a21~0)) (and .cse0 .cse3 (and .cse7 .cse5) .cse8) (and .cse0 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse10 .cse12 (= 9 ~a28~0) .cse13 .cse7) (and .cse14 .cse15 .cse7 .cse5 (= ~a25~0 |old(~a25~0)|)) (and .cse0 .cse1 .cse16 .cse3 .cse5 .cse4 .cse6) (and .cse0 .cse2 .cse16 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4) (= 9 |old(~a28~0)|) (and .cse14 .cse15 .cse16 .cse11 .cse7 .cse5) (not (= 1 |old(~a19~0)|)) (and .cse10 .cse12 .cse13 .cse7 .cse17) (and .cse0 .cse1 .cse2 .cse16 .cse11) (and .cse0 .cse2 .cse16 .cse11 .cse7 .cse4 .cse6) (and .cse9 .cse16 .cse10 .cse13 (not .cse7)) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (= |old(~a17~0)| |old(~a28~0)|) (and .cse0 .cse2 .cse16 .cse11 .cse7 .cse5 .cse6) (< 9 |old(~a28~0)|) (and .cse0 .cse1 .cse3 .cse12 .cse17 .cse5)))) [2018-09-14 15:58:50,315 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-14 15:58:50,315 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-14 15:58:50,315 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse8 (= ~a25~0 1))) (let ((.cse14 (= |old(~a28~0)| ~a28~0)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse4 (<= ~a28~0 9)) (.cse9 (= 7 ~a28~0)) (.cse10 (= 1 ~a11~0)) (.cse13 (= 8 ~a17~0)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse16 (not .cse8)) (.cse11 (= 7 ~a17~0)) (.cse7 (= 1 ~a19~0)) (.cse6 (not (= ~a28~0 9))) (.cse0 (= |old(~a17~0)| 8)) (.cse1 (<= ~a19~0 0)) (.cse3 (= |old(~a17~0)| ~a17~0)) (.cse12 (= 1 ~a25~0)) (.cse17 (= 10 ~a28~0)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= 1 ~a21~0)) (and .cse0 .cse3 (and .cse7 .cse5) .cse8) (and .cse0 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse10 .cse12 (= 9 ~a28~0) .cse13 .cse7) (and .cse14 .cse15 .cse7 .cse5 (= ~a25~0 |old(~a25~0)|)) (and .cse0 .cse1 .cse16 .cse3 .cse5 .cse4 .cse6) (and .cse0 .cse2 .cse16 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4) (= 9 |old(~a28~0)|) (and .cse14 .cse15 .cse16 .cse11 .cse7 .cse5) (not (= 1 |old(~a19~0)|)) (and .cse10 .cse12 .cse13 .cse7 .cse17) (and .cse0 .cse1 .cse2 .cse16 .cse11) (and .cse0 .cse2 .cse16 .cse11 .cse7 .cse4 .cse6) (and .cse9 .cse16 .cse10 .cse13 (not .cse7)) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (= |old(~a17~0)| |old(~a28~0)|) (and .cse0 .cse2 .cse16 .cse11 .cse7 .cse5 .cse6) (< 9 |old(~a28~0)|) (and .cse0 .cse1 .cse3 .cse12 .cse17 .cse5)))) [2018-09-14 15:58:50,315 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-14 15:58:50,315 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-14 15:58:50,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 03:58:50 BoogieIcfgContainer [2018-09-14 15:58:50,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 15:58:50,346 INFO L168 Benchmark]: Toolchain (without parser) took 47158.24 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -422.9 MB). Peak memory consumption was 929.8 MB. Max. memory is 7.1 GB. [2018-09-14 15:58:50,347 INFO L168 Benchmark]: CDTParser took 0.22 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-09-14 15:58:50,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.64 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-09-14 15:58:50,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 15:58:50,353 INFO L168 Benchmark]: Boogie Preprocessor took 205.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -851.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-09-14 15:58:50,354 INFO L168 Benchmark]: RCFGBuilder took 3230.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2018-09-14 15:58:50,358 INFO L168 Benchmark]: TraceAbstraction took 42871.69 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 577.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 278.1 MB). Peak memory consumption was 855.8 MB. Max. memory is 7.1 GB. [2018-09-14 15:58:50,367 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.22 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 741.64 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 101.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 205.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -851.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3230.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42871.69 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 577.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 278.1 MB). Peak memory consumption was 855.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((\old(a17) == 8 && a19 <= 0) && !(a28 == a17)) && \old(a17) == a17) && a28 <= 9) && !(a11 == 1)) && !(a28 == 9)) || !(1 == a21)) || (((\old(a17) == 8 && \old(a17) == a17) && 1 == a19 && !(a11 == 1)) && a25 == 1)) || ((((\old(a17) == 8 && !(a28 == a17)) && \old(a17) == a17) && 1 == a19) && !(a11 == 1))) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || ((((\old(a28) == a28 && a17 == \old(a17)) && 1 == a19) && !(a11 == 1)) && a25 == \old(a25))) || ((((((\old(a17) == 8 && a19 <= 0) && !(a25 == 1)) && \old(a17) == a17) && !(a11 == 1)) && a28 <= 9) && !(a28 == 9))) || (((((\old(a17) == 8 && !(a28 == a17)) && !(a25 == 1)) && \old(a17) == a17) && 1 == a19) && a28 <= 9)) || ((((\old(a17) == 8 && a19 <= 0) && !(a28 == a17)) && 7 == a17) && a28 <= 9)) || 9 == \old(a28)) || (((((\old(a28) == a28 && a17 == \old(a17)) && !(a25 == 1)) && 7 == a17) && 1 == a19) && !(a11 == 1))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || ((((\old(a17) == 8 && a19 <= 0) && !(a28 == a17)) && !(a25 == 1)) && 7 == a17)) || ((((((\old(a17) == 8 && !(a28 == a17)) && !(a25 == 1)) && 7 == a17) && 1 == a19) && a28 <= 9) && !(a28 == 9))) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || 1 == \old(a25)) || 1 == \old(a11)) || \old(a17) == \old(a28)) || ((((((\old(a17) == 8 && !(a28 == a17)) && !(a25 == 1)) && 7 == a17) && 1 == a19) && !(a11 == 1)) && !(a28 == 9))) || 9 < \old(a28)) || (((((\old(a17) == 8 && a19 <= 0) && \old(a17) == a17) && 1 == a25) && 10 == a28) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 42.7s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1641 SDtfs, 8423 SDslu, 1398 SDs, 0 SdLazy, 13046 SolverSat, 2163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4146 GetRequests, 3995 SyntacticMatches, 32 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3942occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 439 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 200 PreInvPairs, 352 NumberOfFragments, 1409 HoareAnnotationTreeSize, 200 FomulaSimplifications, 8930 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4786 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 4341 NumberOfCodeBlocks, 4341 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 6302 ConstructedInterpolants, 0 QuantifiedInterpolants, 5647464 SizeOfPredicates, 16 NumberOfNonLiveVariables, 4213 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 2951/3110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label06_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_15-58-50-409.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label06_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_15-58-50-409.csv Received shutdown request...