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_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:23:11,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:23:11,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:23:11,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:23:11,273 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:23:11,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:23:11,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:23:11,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:23:11,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:23:11,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:23:11,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:23:11,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:23:11,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:23:11,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:23:11,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:23:11,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:23:11,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:23:11,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:23:11,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:23:11,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:23:11,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:23:11,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:23:11,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:23:11,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:23:11,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:23:11,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:23:11,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:23:11,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:23:11,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:23:11,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:23:11,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:23:11,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:23:11,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:23:11,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:23:11,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:23:11,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:23:11,306 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-10 10:23:11,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:23:11,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:23:11,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:23:11,338 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:23:11,338 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:23:11,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:23:11,339 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:23:11,339 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:23:11,339 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:23:11,339 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:23:11,342 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:23:11,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:23:11,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:23:11,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:23:11,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:23:11,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:23:11,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:23:11,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:23:11,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:23:11,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:23:11,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:23:11,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:23:11,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:23:11,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:23:11,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:23:11,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:23:11,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:23:11,348 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:23:11,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:23:11,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:23:11,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:23:11,350 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:23:11,350 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:23:11,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:23:11,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:23:11,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:23:11,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:23:11,435 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:23:11,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-09-10 10:23:11,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0a1abc9/d10abb7e6f2e49efa52387628ebfbac1/FLAG3b300ee60 [2018-09-10 10:23:12,098 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:23:12,099 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-09-10 10:23:12,123 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0a1abc9/d10abb7e6f2e49efa52387628ebfbac1/FLAG3b300ee60 [2018-09-10 10:23:12,145 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0a1abc9/d10abb7e6f2e49efa52387628ebfbac1 [2018-09-10 10:23:12,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:23:12,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:23:12,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:12,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:23:12,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:23:12,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:12,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b4ff69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12, skipping insertion in model container [2018-09-10 10:23:12,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:12,407 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:23:12,710 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:12,738 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:23:12,873 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:12,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12 WrapperNode [2018-09-10 10:23:12,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:12,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:12,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:23:12,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:23:12,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:12,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:13,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:23:13,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:23:13,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:23:13,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (1/1) ... [2018-09-10 10:23:13,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:23:13,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:23:13,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:23:13,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:23:13,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (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-10 10:23:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:23:13,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:23:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:23:13,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:23:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:23:13,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:23:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:23:13,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:23:16,529 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:23:16,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:16 BoogieIcfgContainer [2018-09-10 10:23:16,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:23:16,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:23:16,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:23:16,537 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:23:16,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:23:12" (1/3) ... [2018-09-10 10:23:16,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445a3235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:16, skipping insertion in model container [2018-09-10 10:23:16,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:12" (2/3) ... [2018-09-10 10:23:16,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445a3235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:16, skipping insertion in model container [2018-09-10 10:23:16,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:16" (3/3) ... [2018-09-10 10:23:16,541 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-09-10 10:23:16,552 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:23:16,562 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:23:16,630 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:23:16,631 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:23:16,632 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:23:16,632 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:23:16,632 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:23:16,632 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:23:16,633 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:23:16,633 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:23:16,633 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:23:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:23:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-10 10:23:16,691 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:16,692 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] [2018-09-10 10:23:16,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1495803528, now seen corresponding path program 1 times [2018-09-10 10:23:16,703 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:16,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:16,765 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:17,418 WARN L175 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:17,570 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-10 10:23:17,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:17,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:17,574 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:17,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:17,600 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:17,600 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:17,603 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:23:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:19,079 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-09-10 10:23:19,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:19,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-09-10 10:23:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:19,101 INFO L225 Difference]: With dead ends: 627 [2018-09-10 10:23:19,101 INFO L226 Difference]: Without dead ends: 388 [2018-09-10 10:23:19,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-09-10 10:23:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-09-10 10:23:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-10 10:23:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-09-10 10:23:19,189 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-09-10 10:23:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:19,190 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-09-10 10:23:19,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-09-10 10:23:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-10 10:23:19,199 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:19,199 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] [2018-09-10 10:23:19,199 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1000868541, now seen corresponding path program 1 times [2018-09-10 10:23:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,202 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:19,611 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-10 10:23:19,612 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:19,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:19,612 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:19,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:19,615 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:19,615 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:19,615 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-09-10 10:23:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:21,692 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-09-10 10:23:21,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:21,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-09-10 10:23:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:21,697 INFO L225 Difference]: With dead ends: 905 [2018-09-10 10:23:21,697 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:23:21,703 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-10 10:23:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:23:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-10 10:23:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-10 10:23:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-09-10 10:23:21,738 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-09-10 10:23:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:21,739 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-09-10 10:23:21,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-09-10 10:23:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-10 10:23:21,743 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:21,743 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:21,743 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash 266518143, now seen corresponding path program 1 times [2018-09-10 10:23:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:21,746 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:21,934 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:21,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:23:21,935 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:21,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:23:21,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:23:21,936 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:23:21,936 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-09-10 10:23:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:24,392 INFO L93 Difference]: Finished difference Result 1189 states and 1998 transitions. [2018-09-10 10:23:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:24,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-09-10 10:23:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:24,407 INFO L225 Difference]: With dead ends: 1189 [2018-09-10 10:23:24,408 INFO L226 Difference]: Without dead ends: 813 [2018-09-10 10:23:24,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:23:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-09-10 10:23:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 796. [2018-09-10 10:23:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-09-10 10:23:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1232 transitions. [2018-09-10 10:23:24,460 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1232 transitions. Word has length 123 [2018-09-10 10:23:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:24,460 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 1232 transitions. [2018-09-10 10:23:24,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:23:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1232 transitions. [2018-09-10 10:23:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-10 10:23:24,464 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:24,464 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:24,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash 796049233, now seen corresponding path program 1 times [2018-09-10 10:23:24,465 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:24,466 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:24,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:24,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:24,659 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:24,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:24,659 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:24,660 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:24,660 INFO L87 Difference]: Start difference. First operand 796 states and 1232 transitions. Second operand 3 states. [2018-09-10 10:23:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:26,711 INFO L93 Difference]: Finished difference Result 1882 states and 2963 transitions. [2018-09-10 10:23:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:26,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-09-10 10:23:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:26,722 INFO L225 Difference]: With dead ends: 1882 [2018-09-10 10:23:26,723 INFO L226 Difference]: Without dead ends: 1092 [2018-09-10 10:23:26,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2018-09-10 10:23:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1089. [2018-09-10 10:23:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-09-10 10:23:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1653 transitions. [2018-09-10 10:23:26,763 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1653 transitions. Word has length 126 [2018-09-10 10:23:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:26,763 INFO L480 AbstractCegarLoop]: Abstraction has 1089 states and 1653 transitions. [2018-09-10 10:23:26,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1653 transitions. [2018-09-10 10:23:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-10 10:23:26,768 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:26,768 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] [2018-09-10 10:23:26,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1869611644, now seen corresponding path program 1 times [2018-09-10 10:23:26,769 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:26,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:26,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:26,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:26,770 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:27,230 WARN L175 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:23:27,487 WARN L175 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 10:23:27,622 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-10 10:23:27,622 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:27,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:27,623 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:27,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:27,623 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:27,624 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:27,624 INFO L87 Difference]: Start difference. First operand 1089 states and 1653 transitions. Second operand 5 states. [2018-09-10 10:23:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:28,672 INFO L93 Difference]: Finished difference Result 2317 states and 3569 transitions. [2018-09-10 10:23:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:28,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-09-10 10:23:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:28,680 INFO L225 Difference]: With dead ends: 2317 [2018-09-10 10:23:28,680 INFO L226 Difference]: Without dead ends: 1088 [2018-09-10 10:23:28,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-09-10 10:23:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2018-09-10 10:23:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2018-09-10 10:23:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1633 transitions. [2018-09-10 10:23:28,715 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1633 transitions. Word has length 137 [2018-09-10 10:23:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:28,716 INFO L480 AbstractCegarLoop]: Abstraction has 1088 states and 1633 transitions. [2018-09-10 10:23:28,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1633 transitions. [2018-09-10 10:23:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-10 10:23:28,721 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:28,721 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:28,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1765355605, now seen corresponding path program 1 times [2018-09-10 10:23:28,722 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:28,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:28,724 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:29,017 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:29,017 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-10 10:23:29,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:29,026 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:29,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:29,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:29,843 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-10 10:23:29,949 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-10 10:23:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:30,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:30,349 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 3 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 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:30,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:30,376 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:30,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:30,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (3)] Exception during sending of exit command (exit): Broken pipe [2018-09-10 10:23:30,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:30,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 16 [2018-09-10 10:23:30,860 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:30,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:23:30,862 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:23:30,862 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:23:30,862 INFO L87 Difference]: Start difference. First operand 1088 states and 1633 transitions. Second operand 13 states. [2018-09-10 10:23:32,349 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-10 10:23:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:37,532 INFO L93 Difference]: Finished difference Result 3827 states and 7699 transitions. [2018-09-10 10:23:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-10 10:23:37,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 163 [2018-09-10 10:23:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:37,574 INFO L225 Difference]: With dead ends: 3827 [2018-09-10 10:23:37,574 INFO L226 Difference]: Without dead ends: 2745 [2018-09-10 10:23:37,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 674 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=706, Invalid=2050, Unknown=0, NotChecked=0, Total=2756 [2018-09-10 10:23:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2018-09-10 10:23:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2392. [2018-09-10 10:23:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2018-09-10 10:23:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3284 transitions. [2018-09-10 10:23:37,741 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3284 transitions. Word has length 163 [2018-09-10 10:23:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:37,742 INFO L480 AbstractCegarLoop]: Abstraction has 2392 states and 3284 transitions. [2018-09-10 10:23:37,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:23:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3284 transitions. [2018-09-10 10:23:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-10 10:23:37,763 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:37,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:23:37,763 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1185769165, now seen corresponding path program 1 times [2018-09-10 10:23:37,764 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:37,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:37,765 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:23:38,047 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:38,047 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-10 10:23:38,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:38,063 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:38,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-10 10:23:38,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-10 10:23:39,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:23:39,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2018-09-10 10:23:39,158 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:39,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:23:39,159 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:23:39,159 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:39,159 INFO L87 Difference]: Start difference. First operand 2392 states and 3284 transitions. Second operand 4 states. [2018-09-10 10:23:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:40,411 INFO L93 Difference]: Finished difference Result 7020 states and 9679 transitions. [2018-09-10 10:23:40,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:40,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-09-10 10:23:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:40,434 INFO L225 Difference]: With dead ends: 7020 [2018-09-10 10:23:40,434 INFO L226 Difference]: Without dead ends: 4649 [2018-09-10 10:23:40,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 323 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2018-09-10 10:23:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4634. [2018-09-10 10:23:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4634 states. [2018-09-10 10:23:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4634 states to 4634 states and 6219 transitions. [2018-09-10 10:23:40,581 INFO L78 Accepts]: Start accepts. Automaton has 4634 states and 6219 transitions. Word has length 164 [2018-09-10 10:23:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:40,582 INFO L480 AbstractCegarLoop]: Abstraction has 4634 states and 6219 transitions. [2018-09-10 10:23:40,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:23:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4634 states and 6219 transitions. [2018-09-10 10:23:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-10 10:23:40,600 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:40,601 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:23:40,601 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1665376462, now seen corresponding path program 1 times [2018-09-10 10:23:40,601 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:40,603 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 71 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:23:40,769 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:40,769 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:40,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:40,776 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:40,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-10 10:23:41,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-10 10:23:41,268 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:23:41,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-10 10:23:41,269 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:41,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:41,269 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:41,270 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:23:41,270 INFO L87 Difference]: Start difference. First operand 4634 states and 6219 transitions. Second operand 5 states. [2018-09-10 10:23:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:42,700 INFO L93 Difference]: Finished difference Result 13050 states and 18688 transitions. [2018-09-10 10:23:42,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:23:42,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-09-10 10:23:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:42,746 INFO L225 Difference]: With dead ends: 13050 [2018-09-10 10:23:42,746 INFO L226 Difference]: Without dead ends: 8427 [2018-09-10 10:23:42,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:23:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2018-09-10 10:23:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 8248. [2018-09-10 10:23:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8248 states. [2018-09-10 10:23:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8248 states to 8248 states and 10641 transitions. [2018-09-10 10:23:43,025 INFO L78 Accepts]: Start accepts. Automaton has 8248 states and 10641 transitions. Word has length 179 [2018-09-10 10:23:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:43,026 INFO L480 AbstractCegarLoop]: Abstraction has 8248 states and 10641 transitions. [2018-09-10 10:23:43,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 8248 states and 10641 transitions. [2018-09-10 10:23:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-10 10:23:43,054 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:43,055 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 10:23:43,055 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1735462578, now seen corresponding path program 1 times [2018-09-10 10:23:43,056 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:43,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:43,057 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:43,309 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 10:23:43,698 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:43,698 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-10 10:23:43,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:43,711 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:43,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-10 10:23:43,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-10 10:23:44,305 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:23:44,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 10:23:44,306 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:44,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:44,306 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:44,306 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:23:44,307 INFO L87 Difference]: Start difference. First operand 8248 states and 10641 transitions. Second operand 5 states. [2018-09-10 10:23:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:46,158 INFO L93 Difference]: Finished difference Result 16095 states and 20655 transitions. [2018-09-10 10:23:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:46,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-09-10 10:23:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:46,207 INFO L225 Difference]: With dead ends: 16095 [2018-09-10 10:23:46,208 INFO L226 Difference]: Without dead ends: 7958 [2018-09-10 10:23:46,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:23:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2018-09-10 10:23:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 7956. [2018-09-10 10:23:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7956 states. [2018-09-10 10:23:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7956 states to 7956 states and 9845 transitions. [2018-09-10 10:23:46,437 INFO L78 Accepts]: Start accepts. Automaton has 7956 states and 9845 transitions. Word has length 236 [2018-09-10 10:23:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:46,437 INFO L480 AbstractCegarLoop]: Abstraction has 7956 states and 9845 transitions. [2018-09-10 10:23:46,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7956 states and 9845 transitions. [2018-09-10 10:23:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-10 10:23:46,460 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:46,461 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:46,461 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1692987547, now seen corresponding path program 1 times [2018-09-10 10:23:46,461 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:46,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:46,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:46,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:46,463 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 164 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-10 10:23:46,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:46,776 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:46,784 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:46,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:23:47,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-10 10:23:47,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:47,194 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 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:47,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:47,211 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:47,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:23:48,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-10 10:23:48,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:48,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 19 [2018-09-10 10:23:48,799 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:48,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-10 10:23:48,800 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-10 10:23:48,800 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-09-10 10:23:48,800 INFO L87 Difference]: Start difference. First operand 7956 states and 9845 transitions. Second operand 11 states. [2018-09-10 10:23:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:54,612 INFO L93 Difference]: Finished difference Result 20547 states and 25779 transitions. [2018-09-10 10:23:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-10 10:23:54,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2018-09-10 10:23:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:54,645 INFO L225 Difference]: With dead ends: 20547 [2018-09-10 10:23:54,646 INFO L226 Difference]: Without dead ends: 11500 [2018-09-10 10:23:54,666 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 991 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=503, Invalid=2467, Unknown=0, NotChecked=0, Total=2970 [2018-09-10 10:23:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11500 states. [2018-09-10 10:23:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11500 to 7679. [2018-09-10 10:23:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7679 states. [2018-09-10 10:23:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7679 states to 7679 states and 8459 transitions. [2018-09-10 10:23:54,860 INFO L78 Accepts]: Start accepts. Automaton has 7679 states and 8459 transitions. Word has length 244 [2018-09-10 10:23:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:54,860 INFO L480 AbstractCegarLoop]: Abstraction has 7679 states and 8459 transitions. [2018-09-10 10:23:54,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-10 10:23:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7679 states and 8459 transitions. [2018-09-10 10:23:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-10 10:23:54,875 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:54,875 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:54,875 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash -365878485, now seen corresponding path program 1 times [2018-09-10 10:23:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:54,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:54,877 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 155 proven. 68 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-10 10:23:55,121 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:55,121 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:55,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:55,129 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:55,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:23:55,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 194 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-10 10:23:55,558 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:55,559 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 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:55,574 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:55,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:23:55,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 194 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-10 10:23:56,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:56,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-10 10:23:56,092 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:56,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:23:56,093 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:23:56,093 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:23:56,093 INFO L87 Difference]: Start difference. First operand 7679 states and 8459 transitions. Second operand 9 states. [2018-09-10 10:23:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:59,398 INFO L93 Difference]: Finished difference Result 12864 states and 14197 transitions. [2018-09-10 10:23:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-10 10:23:59,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 257 [2018-09-10 10:23:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:59,401 INFO L225 Difference]: With dead ends: 12864 [2018-09-10 10:23:59,401 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:23:59,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 1029 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-09-10 10:23:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:23:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:23:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:23:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:23:59,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2018-09-10 10:23:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:59,422 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:23:59,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:23:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:23:59,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:23:59,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:23:59,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:59,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,010 WARN L175 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 126 [2018-09-10 10:24:00,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:00,395 WARN L175 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 126 [2018-09-10 10:24:00,645 WARN L175 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-09-10 10:24:05,805 WARN L175 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 216 DAG size of output: 83 [2018-09-10 10:24:07,236 WARN L175 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-09-10 10:24:08,473 WARN L175 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:24:08,477 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:24:08,478 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:24:08,479 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:24:08,480 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,481 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:24:08,482 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,483 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:24:08,484 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,485 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:24:08,486 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,487 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:24:08,488 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,489 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:24:08,490 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:24:08,491 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:24:08,492 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:24:08,493 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:24:08,494 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:24:08,495 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,496 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:24:08,497 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|)) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0))) (let ((.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse1 (or .cse14 .cse15)) (.cse22 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse23 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse24 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse25 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) (let ((.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (.cse8 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 8)) (.cse13 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse11 (and .cse1 .cse22 .cse23 .cse24 .cse25)) (.cse7 (and .cse22 .cse23 .cse24 .cse25)) (.cse19 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse18 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse12 (not .cse3)) (.cse20 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1))) (.cse5 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (.cse6 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse17 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse21 (and .cse15 .cse22 .cse23 .cse24 .cse25)) (.cse0 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse16 (not .cse4)) (.cse9 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 (or .cse0 .cse8 .cse2 .cse4 .cse9 .cse10) .cse5) (or .cse8 .cse2 .cse11 .cse12 .cse4 .cse13 .cse10 .cse6) (or .cse0 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (or (or .cse0 .cse8 .cse2 .cse14 .cse9) .cse15 .cse5) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) .cse0 .cse2 .cse3 .cse16 .cse9) (or .cse2 .cse11 .cse3 .cse16 .cse13 .cse6) (or .cse11 .cse12 (or .cse0 .cse17 .cse2 .cse9)) (or .cse2 .cse18 .cse12 .cse16 (and .cse19 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) .cse9 .cse20) (or (or .cse0 .cse2 .cse4 .cse14 .cse9) .cse12 .cse21 .cse5) (or .cse0 .cse2 .cse21 .cse12 .cse16 .cse14 .cse5 .cse6) (or .cse0 .cse17 .cse2 .cse5 .cse6 .cse7) (or .cse2 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) .cse19 .cse18 .cse12 .cse9 .cse20) (or .cse0 .cse17 .cse2 .cse14 .cse15 .cse5 .cse6) (or .cse0 .cse17 .cse2 .cse14 .cse9 .cse21) (or .cse0 .cse2 .cse16 .cse9 (and .cse22 .cse23 .cse24)) (or .cse0 .cse2 .cse15 .cse16 .cse14 .cse9))))) [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:24:08,498 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (or (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:24:08,499 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0)) [2018-09-10 10:24:08,500 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:24:08,500 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:24:08,500 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) [2018-09-10 10:24:08,500 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:24:08,500 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse22 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse9 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0))) (let ((.cse10 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse16 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10))) (.cse14 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 8))) (.cse17 (not (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (.cse13 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse21 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse11 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse3 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (or .cse22 (not .cse9))) (.cse5 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0)) (.cse18 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse19 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse20 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (and .cse6 .cse7 .cse8 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse11 .cse12) (and .cse9 .cse10 .cse7 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse5) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse13 (and .cse1 .cse6 .cse5) .cse7) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse13 .cse8 .cse18 .cse19 .cse20 .cse5) (and .cse0 .cse21 .cse2 .cse16 .cse3 .cse4 .cse5) (and .cse2 .cse14 .cse3 .cse6 .cse17 .cse4 .cse5) (and .cse0 .cse13 .cse21 .cse15 .cse11 .cse5) (and .cse2 .cse6 .cse4 .cse11 .cse5) (and .cse0 .cse7 .cse11 .cse8 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse22 .cse18 .cse19 .cse20)))) [2018-09-10 10:24:08,500 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:24:08,500 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:24:08,501 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse22 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse9 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0))) (let ((.cse10 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse16 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10))) (.cse14 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 8))) (.cse17 (not (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (.cse13 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse21 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse11 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse3 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (or .cse22 (not .cse9))) (.cse5 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0)) (.cse18 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse19 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse20 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (and .cse6 .cse7 .cse8 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse11 .cse12) (and .cse9 .cse10 .cse7 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse5) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse13 (and .cse1 .cse6 .cse5) .cse7) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse13 .cse8 .cse18 .cse19 .cse20 .cse5) (and .cse0 .cse21 .cse2 .cse16 .cse3 .cse4 .cse5) (and .cse2 .cse14 .cse3 .cse6 .cse17 .cse4 .cse5) (and .cse0 .cse13 .cse21 .cse15 .cse11 .cse5) (and .cse2 .cse6 .cse4 .cse11 .cse5) (and .cse0 .cse7 .cse11 .cse8 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse22 .cse18 .cse19 .cse20)))) [2018-09-10 10:24:08,501 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:24:08,501 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:24:08,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:24:08 BoogieIcfgContainer [2018-09-10 10:24:08,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:24:08,541 INFO L168 Benchmark]: Toolchain (without parser) took 56381.58 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 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-10 10:24:08,542 INFO L168 Benchmark]: CDTParser took 0.19 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-10 10:24:08,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.63 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:08,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.26 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-10 10:24:08,544 INFO L168 Benchmark]: Boogie Preprocessor took 197.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:08,545 INFO L168 Benchmark]: RCFGBuilder took 3322.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:08,545 INFO L168 Benchmark]: TraceAbstraction took 52007.71 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 641.2 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -476.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-10 10:24:08,555 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.19 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 762.63 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.26 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 197.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3322.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52007.71 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 641.2 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -476.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: 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: (((((((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 || !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11)) || ((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 || !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 8)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && !(7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == 1)) || 8 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || 7 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 <= 0) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || ((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 || !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || ((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 8)) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && !(7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 || !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 || !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || (((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 || !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 7)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 <= 0 && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 51.8s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 29.8s AutomataDifference, 0.0s DeadEndRemovalTime, 9.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1259 SDtfs, 12203 SDslu, 1739 SDs, 0 SdLazy, 15759 SolverSat, 3278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4046 GetRequests, 3851 SyntacticMatches, 21 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8248occurred in iteration=8, 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: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 4395 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 250 PreInvPairs, 336 NumberOfFragments, 1300 HoareAnnotationTreeSize, 250 FomulaSimplifications, 61725 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6806 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 3769 NumberOfCodeBlocks, 3769 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5647 ConstructedInterpolants, 0 QuantifiedInterpolants, 2723728 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4646 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 3584/4064 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_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-24-08-577.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-24-08-577.csv Received shutdown request...