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/Problem01_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:19:58,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:19:58,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:19:58,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:19:58,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:19:58,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:19:58,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:19:58,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:19:58,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:19:58,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:19:58,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:19:58,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:19:58,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:19:58,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:19:58,341 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:19:58,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:19:58,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:19:58,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:19:58,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:19:58,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:19:58,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:19:58,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:19:58,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:19:58,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:19:58,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:19:58,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:19:58,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:19:58,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:19:58,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:19:58,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:19:58,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:19:58,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:19:58,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:19:58,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:19:58,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:19:58,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:19:58,386 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:19:58,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:19:58,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:19:58,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:19:58,418 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:19:58,419 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:19:58,419 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:19:58,419 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:19:58,419 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:19:58,420 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:19:58,420 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:19:58,420 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:19:58,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:19:58,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:19:58,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:19:58,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:19:58,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:19:58,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:19:58,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:19:58,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:19:58,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:19:58,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:19:58,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:19:58,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:19:58,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:19:58,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:19:58,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:19:58,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:19:58,426 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:19:58,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:19:58,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:19:58,427 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:19:58,427 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:19:58,427 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:19:58,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:19:58,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:19:58,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:19:58,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:19:58,515 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:19:58,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-09-10 10:19:58,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbeba48a/0a21c90f09a348c7a2abfba4f19d0947/FLAGc7975bdad [2018-09-10 10:19:59,148 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:19:59,149 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-09-10 10:19:59,168 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbeba48a/0a21c90f09a348c7a2abfba4f19d0947/FLAGc7975bdad [2018-09-10 10:19:59,190 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbeba48a/0a21c90f09a348c7a2abfba4f19d0947 [2018-09-10 10:19:59,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:19:59,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:19:59,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:19:59,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:19:59,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:19:59,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:19:59,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8699f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59, skipping insertion in model container [2018-09-10 10:19:59,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:19:59,450 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:19:59,731 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:19:59,756 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:19:59,871 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:19:59,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59 WrapperNode [2018-09-10 10:19:59,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:19:59,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:19:59,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:19:59,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:19:59,925 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:19:59" (1/1) ... [2018-09-10 10:19:59,949 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:19:59" (1/1) ... [2018-09-10 10:20:00,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:20:00,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:20:00,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:20:00,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:20:00,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (1/1) ... [2018-09-10 10:20:00,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:20:00,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:20:00,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:20:00,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:20:00,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (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:20:00,354 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:20:00,354 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:20:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:20:00,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:20:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:20:00,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:20:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:20:00,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:20:03,686 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:20:03,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:20:03 BoogieIcfgContainer [2018-09-10 10:20:03,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:20:03,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:20:03,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:20:03,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:20:03,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:19:59" (1/3) ... [2018-09-10 10:20:03,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a6ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:20:03, skipping insertion in model container [2018-09-10 10:20:03,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:59" (2/3) ... [2018-09-10 10:20:03,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a6ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:20:03, skipping insertion in model container [2018-09-10 10:20:03,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:20:03" (3/3) ... [2018-09-10 10:20:03,695 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-09-10 10:20:03,706 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:20:03,715 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:20:03,771 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:20:03,772 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:20:03,772 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:20:03,772 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:20:03,773 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:20:03,773 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:20:03,775 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:20:03,775 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:20:03,775 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:20:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-10 10:20:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-10 10:20:03,815 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:03,816 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] [2018-09-10 10:20:03,817 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:20:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash -57602632, now seen corresponding path program 1 times [2018-09-10 10:20:03,827 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:03,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:03,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:03,881 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:04,490 WARN L175 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:20:04,678 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:20:04,681 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:04,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:20:04,682 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:04,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:20:04,706 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:20:04,707 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:04,710 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-09-10 10:20:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:06,574 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-09-10 10:20:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:20:06,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-09-10 10:20:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:06,596 INFO L225 Difference]: With dead ends: 550 [2018-09-10 10:20:06,596 INFO L226 Difference]: Without dead ends: 340 [2018-09-10 10:20:06,603 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:20:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-10 10:20:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-10 10:20:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-10 10:20:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-09-10 10:20:06,677 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 108 [2018-09-10 10:20:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:06,678 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-09-10 10:20:06,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:20:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-09-10 10:20:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-10 10:20:06,685 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:06,685 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] [2018-09-10 10:20:06,686 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:20:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash 265933973, now seen corresponding path program 1 times [2018-09-10 10:20:06,686 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:06,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:06,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:06,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:06,688 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:06,898 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:20:06,898 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:06,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:20:06,899 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:06,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:20:06,901 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:20:06,902 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:20:06,902 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-09-10 10:20:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:08,839 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-09-10 10:20:08,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:20:08,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-09-10 10:20:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:08,849 INFO L225 Difference]: With dead ends: 1075 [2018-09-10 10:20:08,849 INFO L226 Difference]: Without dead ends: 741 [2018-09-10 10:20:08,857 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:20:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-09-10 10:20:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-09-10 10:20:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-09-10 10:20:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-09-10 10:20:08,916 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 119 [2018-09-10 10:20:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:08,916 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-09-10 10:20:08,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:20:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-09-10 10:20:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-10 10:20:08,924 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:08,924 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:08,924 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:20:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash 467638443, now seen corresponding path program 1 times [2018-09-10 10:20:08,925 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:08,927 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:09,300 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:09,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:20:09,301 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:09,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:20:09,302 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:20:09,302 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:20:09,302 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-09-10 10:20:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:11,247 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-09-10 10:20:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:20:11,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-09-10 10:20:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:11,253 INFO L225 Difference]: With dead ends: 1578 [2018-09-10 10:20:11,253 INFO L226 Difference]: Without dead ends: 721 [2018-09-10 10:20:11,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:20:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-09-10 10:20:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-09-10 10:20:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-09-10 10:20:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-09-10 10:20:11,290 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 120 [2018-09-10 10:20:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:11,291 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-09-10 10:20:11,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:20:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-09-10 10:20:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-10 10:20:11,294 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:11,294 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:11,295 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:20:11,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1736570077, now seen corresponding path program 1 times [2018-09-10 10:20:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:11,297 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:11,580 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:11,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:20:11,580 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:11,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:20:11,581 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:20:11,581 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:20:11,581 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 4 states. [2018-09-10 10:20:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:13,697 INFO L93 Difference]: Finished difference Result 1708 states and 2510 transitions. [2018-09-10 10:20:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:20:13,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-09-10 10:20:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:13,707 INFO L225 Difference]: With dead ends: 1708 [2018-09-10 10:20:13,708 INFO L226 Difference]: Without dead ends: 993 [2018-09-10 10:20:13,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:20:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-09-10 10:20:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-09-10 10:20:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-09-10 10:20:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1361 transitions. [2018-09-10 10:20:13,745 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1361 transitions. Word has length 124 [2018-09-10 10:20:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:13,746 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1361 transitions. [2018-09-10 10:20:13,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:20:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1361 transitions. [2018-09-10 10:20:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-10 10:20:13,752 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:13,752 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:13,753 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:20:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -41325795, now seen corresponding path program 1 times [2018-09-10 10:20:13,754 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:13,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:13,755 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-10 10:20:13,958 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:20:13,959 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:20:13,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:13,968 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:20:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:14,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:20:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:20:14,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:20:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:20:14,859 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:20:14,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:20:14,860 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:14,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:20:14,861 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:20:14,861 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:20:14,862 INFO L87 Difference]: Start difference. First operand 993 states and 1361 transitions. Second operand 3 states. [2018-09-10 10:20:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:16,522 INFO L93 Difference]: Finished difference Result 2721 states and 3785 transitions. [2018-09-10 10:20:16,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:20:16,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-09-10 10:20:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:16,535 INFO L225 Difference]: With dead ends: 2721 [2018-09-10 10:20:16,535 INFO L226 Difference]: Without dead ends: 1734 [2018-09-10 10:20:16,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 338 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:20:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2018-09-10 10:20:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1731. [2018-09-10 10:20:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-09-10 10:20:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2258 transitions. [2018-09-10 10:20:16,588 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2258 transitions. Word has length 170 [2018-09-10 10:20:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:16,589 INFO L480 AbstractCegarLoop]: Abstraction has 1731 states and 2258 transitions. [2018-09-10 10:20:16,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:20:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2258 transitions. [2018-09-10 10:20:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-10 10:20:16,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:16,596 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:16,597 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:20:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash 225658880, now seen corresponding path program 1 times [2018-09-10 10:20:16,597 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:16,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:16,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:16,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:16,598 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 93 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-10 10:20:16,759 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:20:16,759 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:20:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:16,772 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:20:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:16,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:20:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:20:17,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:20:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:20:17,469 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:20:17,469 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 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:20:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:17,485 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:20:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:17,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:20:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:20:17,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:20:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:20:18,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:20:18,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 18 [2018-09-10 10:20:18,114 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:20:18,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:20:18,115 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:20:18,115 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:20:18,116 INFO L87 Difference]: Start difference. First operand 1731 states and 2258 transitions. Second operand 9 states. [2018-09-10 10:20:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:23,376 INFO L93 Difference]: Finished difference Result 9336 states and 12899 transitions. [2018-09-10 10:20:23,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-10 10:20:23,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2018-09-10 10:20:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:23,425 INFO L225 Difference]: With dead ends: 9336 [2018-09-10 10:20:23,425 INFO L226 Difference]: Without dead ends: 7611 [2018-09-10 10:20:23,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2018-09-10 10:20:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7611 states. [2018-09-10 10:20:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7611 to 7083. [2018-09-10 10:20:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7083 states. [2018-09-10 10:20:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7083 states to 7083 states and 8483 transitions. [2018-09-10 10:20:23,643 INFO L78 Accepts]: Start accepts. Automaton has 7083 states and 8483 transitions. Word has length 189 [2018-09-10 10:20:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:23,644 INFO L480 AbstractCegarLoop]: Abstraction has 7083 states and 8483 transitions. [2018-09-10 10:20:23,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:20:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7083 states and 8483 transitions. [2018-09-10 10:20:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-10 10:20:23,664 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:23,665 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:23,665 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:20:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash 295341412, now seen corresponding path program 1 times [2018-09-10 10:20:23,665 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:23,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:23,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:23,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:23,668 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 111 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-10 10:20:23,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:20:23,985 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:20:23,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:23,993 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:20:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:24,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:20:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 122 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 10:20:24,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:20:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 157 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 10:20:24,922 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:20:24,923 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 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:20:24,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:24,940 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:20:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:25,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:20:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 122 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 10:20:25,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:20:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 157 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 10:20:25,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:20:25,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 4, 4] total 13 [2018-09-10 10:20:25,477 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:20:25,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:20:25,478 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:20:25,478 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:20:25,479 INFO L87 Difference]: Start difference. First operand 7083 states and 8483 transitions. Second operand 8 states. [2018-09-10 10:20:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:27,954 INFO L93 Difference]: Finished difference Result 12192 states and 14938 transitions. [2018-09-10 10:20:27,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-10 10:20:27,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 207 [2018-09-10 10:20:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:27,956 INFO L225 Difference]: With dead ends: 12192 [2018-09-10 10:20:27,956 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:20:27,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 827 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:20:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:20:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:20:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:20:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:20:27,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-09-10 10:20:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:27,993 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:20:27,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:20:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:20:27,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:20:27,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:20:28,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:28,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:28,253 WARN L175 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 97 [2018-09-10 10:20:28,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:28,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:28,366 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 97 [2018-09-10 10:20:28,716 WARN L175 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-10 10:20:28,988 WARN L175 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-09-10 10:20:30,805 WARN L175 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 134 DAG size of output: 75 [2018-09-10 10:20:31,753 WARN L175 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2018-09-10 10:20:32,220 WARN L175 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2018-09-10 10:20:32,222 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,223 INFO L426 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-09-10 10:20:32,224 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-09-10 10:20:32,225 INFO L426 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-09-10 10:20:32,226 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-09-10 10:20:32,227 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 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 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 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-09-10 10:20:32,227 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-09-10 10:20:32,228 INFO L426 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-09-10 10:20:32,229 INFO L426 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-09-10 10:20:32,230 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-09-10 10:20:32,231 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-09-10 10:20:32,232 INFO L426 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-09-10 10:20:32,233 INFO L426 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-09-10 10:20:32,234 INFO L426 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-09-10 10:20:32,235 INFO L426 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,236 INFO L426 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-09-10 10:20:32,237 INFO L426 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-09-10 10:20:32,238 INFO L426 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-09-10 10:20:32,239 INFO L426 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-09-10 10:20:32,240 INFO L426 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-09-10 10:20:32,240 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-09-10 10:20:32,240 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-09-10 10:20:32,240 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-09-10 10:20:32,240 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 479) no Hoare annotation was computed. [2018-09-10 10:20:32,240 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-09-10 10:20:32,240 INFO L426 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-09-10 10:20:32,241 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-09-10 10:20:32,242 INFO L426 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-09-10 10:20:32,243 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-09-10 10:20:32,243 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-09-10 10:20:32,243 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 30 575) the Hoare annotation is: (let ((.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)|)) (.cse9 (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)) (.cse13 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse18 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 4))) (let ((.cse16 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (.cse3 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1))) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (.cse0 (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) (.cse5 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1))) (.cse7 (not .cse12)) (.cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 15)) (.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1)) (.cse10 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse15 (and .cse8 .cse9 .cse13 .cse17 .cse18)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8))) (.cse14 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse19 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 5)))) (and (or (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0) (= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse2) .cse3 (not .cse4) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13)) .cse5 .cse6 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1)) .cse7) (or .cse5 (and .cse8 .cse9 .cse10 .cse0 .cse2) .cse6 .cse4 .cse7) (or .cse11 .cse6 .cse12 .cse13 .cse14 .cse4) (or .cse15 .cse6 .cse16 .cse14) (or .cse6 (and .cse8 .cse9 .cse17 .cse18) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) .cse16) (or .cse3 (and .cse9 .cse10 .cse17 .cse1 .cse2) .cse5 .cse6 .cse4) (or (and .cse8 .cse9 .cse13 .cse0 .cse2) .cse5 .cse6 .cse14 .cse7) (or .cse10 .cse6 .cse14 .cse4 .cse19) (or .cse11 .cse6 .cse12 .cse4 (and .cse8 .cse9 .cse10 .cse17 .cse18)) (or .cse15 .cse6 .cse14 .cse19)))) [2018-09-10 10:20:32,243 INFO L426 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,243 INFO L426 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-09-10 10:20:32,244 INFO L426 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)|) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:20:32,245 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:20:32,246 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0) (<= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) [2018-09-10 10:20:32,246 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:20:32,246 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:20:32,246 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (not (= |old(~__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__a8~0)| 15) (and (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 5))) [2018-09-10 10:20:32,246 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:20:32,247 INFO L422 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0)) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (and (= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse2) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (and .cse3 .cse0 .cse2) (and .cse3 .cse4) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 15) (and .cse5 .cse0 .cse2) (and (not .cse0) .cse5 (<= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (and .cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (and (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) .cse3) (and .cse5 .cse1 .cse2) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 5)))) [2018-09-10 10:20:32,247 INFO L426 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-09-10 10:20:32,247 INFO L426 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-09-10 10:20:32,247 INFO L426 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-09-10 10:20:32,247 INFO L422 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0)) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (and (= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse2) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (and .cse3 .cse0 .cse2) (and .cse3 .cse4) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 15) (and .cse5 .cse0 .cse2) (and (not .cse0) .cse5 (<= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (and .cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (and (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) .cse3) (and .cse5 .cse1 .cse2) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 5)))) [2018-09-10 10:20:32,247 INFO L426 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:20:32,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:20:32 BoogieIcfgContainer [2018-09-10 10:20:32,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:20:32,269 INFO L168 Benchmark]: Toolchain (without parser) took 33067.44 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -261.3 MB). Peak memory consumption was 853.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:32,270 INFO L168 Benchmark]: CDTParser took 0.21 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:20:32,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:32,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.30 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:32,273 INFO L168 Benchmark]: Boogie Preprocessor took 238.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:32,273 INFO L168 Benchmark]: RCFGBuilder took 3438.42 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: 132.8 MB). Peak memory consumption was 132.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:32,274 INFO L168 Benchmark]: TraceAbstraction took 28580.73 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 341.3 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 407.1 MB). Peak memory consumption was 748.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:32,279 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.21 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 708.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.30 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 238.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3438.42 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: 132.8 MB). Peak memory consumption was 132.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28580.73 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 341.3 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 407.1 MB). Peak memory consumption was 748.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((13 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) && 1 == __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__a21) || !(\old(__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__a17 <= 0 && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || (__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__a21 <= 0)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8) < 15) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || ((!(4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && 15 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8)) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6))) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) == 1)) || (5 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 && __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__a7 == 1) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7) == 1) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 28.4s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 867 SDtfs, 5326 SDslu, 783 SDs, 0 SdLazy, 6381 SolverSat, 1516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2024 GetRequests, 1940 SyntacticMatches, 9 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7083occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 548 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 130 PreInvPairs, 238 NumberOfFragments, 592 HoareAnnotationTreeSize, 130 FomulaSimplifications, 3906 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4087 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1999 NumberOfCodeBlocks, 1999 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2944 ConstructedInterpolants, 0 QuantifiedInterpolants, 1432195 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2846 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 2070/2235 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/Problem01_label29_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-20-32-297.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label29_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-20-32-297.csv Received shutdown request...