java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:21:33,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:21:33,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:21:33,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:21:33,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:21:33,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:21:33,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:21:33,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:21:33,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:21:33,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:21:33,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:21:33,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:21:33,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:21:33,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:21:33,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:21:33,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:21:33,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:21:33,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:21:33,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:21:33,838 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:21:33,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:21:33,841 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:21:33,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:21:33,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:21:33,844 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:21:33,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:21:33,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:21:33,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:21:33,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:21:33,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:21:33,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:21:33,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:21:33,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:21:33,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:21:33,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:21:33,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:21:33,852 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:21:33,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:21:33,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:21:33,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:21:33,883 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:21:33,883 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:21:33,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:21:33,883 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:21:33,884 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:21:33,884 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:21:33,884 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:21:33,884 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:21:33,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:21:33,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:21:33,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:21:33,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:21:33,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:21:33,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:21:33,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:21:33,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:21:33,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:21:33,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:21:33,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:21:33,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:21:33,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:21:33,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:21:33,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:21:33,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:21:33,890 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:21:33,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:21:33,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:21:33,891 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:21:33,891 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:21:33,892 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:21:33,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:21:33,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:21:33,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:21:33,967 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:21:33,968 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:21:33,968 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c [2018-09-10 10:21:34,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404862a53/e08d9d82ae7344ac86e51a5a84c1db92/FLAG48f956004 [2018-09-10 10:21:34,563 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:21:34,564 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c [2018-09-10 10:21:34,598 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404862a53/e08d9d82ae7344ac86e51a5a84c1db92/FLAG48f956004 [2018-09-10 10:21:34,622 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404862a53/e08d9d82ae7344ac86e51a5a84c1db92 [2018-09-10 10:21:34,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:21:34,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:21:34,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:34,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:21:34,652 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:21:34,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:34" (1/1) ... [2018-09-10 10:21:34,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9e2d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:34, skipping insertion in model container [2018-09-10 10:21:34,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:34" (1/1) ... [2018-09-10 10:21:34,885 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:21:35,141 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:35,170 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:21:35,306 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:35,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35 WrapperNode [2018-09-10 10:21:35,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:35,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:35,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:21:35,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:21:35,363 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:21:35" (1/1) ... [2018-09-10 10:21:35,400 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:21:35" (1/1) ... [2018-09-10 10:21:35,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:35,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:21:35,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:21:35,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:21:35,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (1/1) ... [2018-09-10 10:21:35,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:21:35,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:21:35,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:21:35,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:21:35,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (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:21:35,771 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:21:35,772 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:21:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:21:35,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:21:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:21:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:21:35,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:21:38,989 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:21:38,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:38 BoogieIcfgContainer [2018-09-10 10:21:38,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:21:38,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:21:38,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:21:38,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:21:38,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:21:34" (1/3) ... [2018-09-10 10:21:38,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2054e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:21:38, skipping insertion in model container [2018-09-10 10:21:38,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:35" (2/3) ... [2018-09-10 10:21:38,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2054e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:21:38, skipping insertion in model container [2018-09-10 10:21:38,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:38" (3/3) ... [2018-09-10 10:21:38,999 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label08_true-unreach-call_false-termination.c [2018-09-10 10:21:39,010 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:21:39,019 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:21:39,075 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:21:39,076 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:21:39,076 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:21:39,076 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:21:39,076 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:21:39,077 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:21:39,077 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:21:39,077 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:21:39,077 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:21:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:21:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-10 10:21:39,129 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:39,130 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:39,132 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:21:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -826481979, now seen corresponding path program 1 times [2018-09-10 10:21:39,139 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:39,190 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:39,850 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:21:39,853 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:39,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:21:39,853 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:39,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:39,878 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:39,879 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:39,882 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:21:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:41,603 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-09-10 10:21:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:41,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-09-10 10:21:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:41,625 INFO L225 Difference]: With dead ends: 618 [2018-09-10 10:21:41,625 INFO L226 Difference]: Without dead ends: 379 [2018-09-10 10:21:41,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-10 10:21:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-09-10 10:21:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-09-10 10:21:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-09-10 10:21:41,711 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 129 [2018-09-10 10:21:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:41,712 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-09-10 10:21:41,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-09-10 10:21:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-10 10:21:41,720 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:41,720 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, 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:21:41,721 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:21:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1286398384, now seen corresponding path program 1 times [2018-09-10 10:21:41,721 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:41,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:41,723 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:41,984 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:21:41,985 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:41,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:21:41,985 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:41,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:41,988 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:41,988 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:21:41,988 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-09-10 10:21:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:44,172 INFO L93 Difference]: Finished difference Result 1179 states and 1996 transitions. [2018-09-10 10:21:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:44,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-09-10 10:21:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:44,187 INFO L225 Difference]: With dead ends: 1179 [2018-09-10 10:21:44,187 INFO L226 Difference]: Without dead ends: 806 [2018-09-10 10:21:44,193 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:21:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-09-10 10:21:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 801. [2018-09-10 10:21:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-09-10 10:21:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1250 transitions. [2018-09-10 10:21:44,272 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1250 transitions. Word has length 145 [2018-09-10 10:21:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:44,273 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1250 transitions. [2018-09-10 10:21:44,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1250 transitions. [2018-09-10 10:21:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-10 10:21:44,284 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:44,285 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:44,285 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:21:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -180703235, now seen corresponding path program 1 times [2018-09-10 10:21:44,286 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:44,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:44,287 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:44,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:44,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:21:44,648 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:44,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:44,649 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:44,649 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:21:44,650 INFO L87 Difference]: Start difference. First operand 801 states and 1250 transitions. Second operand 6 states. [2018-09-10 10:21:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:48,292 INFO L93 Difference]: Finished difference Result 2467 states and 4003 transitions. [2018-09-10 10:21:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:48,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2018-09-10 10:21:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:48,309 INFO L225 Difference]: With dead ends: 2467 [2018-09-10 10:21:48,309 INFO L226 Difference]: Without dead ends: 1672 [2018-09-10 10:21:48,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:21:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-09-10 10:21:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1636. [2018-09-10 10:21:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-09-10 10:21:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2421 transitions. [2018-09-10 10:21:48,397 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2421 transitions. Word has length 152 [2018-09-10 10:21:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:48,397 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2421 transitions. [2018-09-10 10:21:48,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2421 transitions. [2018-09-10 10:21:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-10 10:21:48,405 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:48,405 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:48,405 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:21:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1369756805, now seen corresponding path program 1 times [2018-09-10 10:21:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:48,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:48,407 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:48,753 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:48,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:48,753 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:48,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:48,754 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:48,754 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:48,755 INFO L87 Difference]: Start difference. First operand 1636 states and 2421 transitions. Second operand 5 states. [2018-09-10 10:21:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:50,434 INFO L93 Difference]: Finished difference Result 3411 states and 5109 transitions. [2018-09-10 10:21:50,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:50,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-09-10 10:21:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:50,455 INFO L225 Difference]: With dead ends: 3411 [2018-09-10 10:21:50,455 INFO L226 Difference]: Without dead ends: 1633 [2018-09-10 10:21:50,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-09-10 10:21:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2018-09-10 10:21:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2018-09-10 10:21:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2383 transitions. [2018-09-10 10:21:50,514 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2383 transitions. Word has length 156 [2018-09-10 10:21:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:50,515 INFO L480 AbstractCegarLoop]: Abstraction has 1633 states and 2383 transitions. [2018-09-10 10:21:50,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2383 transitions. [2018-09-10 10:21:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-10 10:21:50,522 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:50,522 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:50,522 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:21:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -96082744, now seen corresponding path program 1 times [2018-09-10 10:21:50,523 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:50,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:50,524 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:50,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:50,667 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:21:50,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:50,677 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:50,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:51,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:51,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:51,926 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:21:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:51,942 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:52,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:52,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:52,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:21:52,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-10 10:21:52,425 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:21:52,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:21:52,427 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:21:52,427 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:21:52,428 INFO L87 Difference]: Start difference. First operand 1633 states and 2383 transitions. Second operand 9 states. [2018-09-10 10:21:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:57,882 INFO L93 Difference]: Finished difference Result 7173 states and 12729 transitions. [2018-09-10 10:21:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 10:21:57,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2018-09-10 10:21:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:57,938 INFO L225 Difference]: With dead ends: 7173 [2018-09-10 10:21:57,938 INFO L226 Difference]: Without dead ends: 5546 [2018-09-10 10:21:57,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 643 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:21:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2018-09-10 10:21:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5376. [2018-09-10 10:21:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2018-09-10 10:21:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 7856 transitions. [2018-09-10 10:21:58,208 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 7856 transitions. Word has length 161 [2018-09-10 10:21:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:58,208 INFO L480 AbstractCegarLoop]: Abstraction has 5376 states and 7856 transitions. [2018-09-10 10:21:58,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:21:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 7856 transitions. [2018-09-10 10:21:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-10 10:21:58,235 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:58,235 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:58,236 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:21:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -703526698, now seen corresponding path program 1 times [2018-09-10 10:21:58,236 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:58,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:58,238 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:58,715 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:58,716 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:58,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:58,724 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:58,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:21:58,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:21:59,094 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:21:59,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-09-10 10:21:59,095 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:59,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:59,095 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:59,096 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:21:59,096 INFO L87 Difference]: Start difference. First operand 5376 states and 7856 transitions. Second operand 3 states. [2018-09-10 10:22:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:00,293 INFO L93 Difference]: Finished difference Result 14696 states and 21926 transitions. [2018-09-10 10:22:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:00,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-09-10 10:22:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:00,361 INFO L225 Difference]: With dead ends: 14696 [2018-09-10 10:22:00,361 INFO L226 Difference]: Without dead ends: 9326 [2018-09-10 10:22:00,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:22:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9326 states. [2018-09-10 10:22:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9326 to 9166. [2018-09-10 10:22:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2018-09-10 10:22:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 12611 transitions. [2018-09-10 10:22:00,742 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 12611 transitions. Word has length 166 [2018-09-10 10:22:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:00,743 INFO L480 AbstractCegarLoop]: Abstraction has 9166 states and 12611 transitions. [2018-09-10 10:22:00,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 12611 transitions. [2018-09-10 10:22:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-10 10:22:00,793 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:00,793 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:00,794 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:22:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1197247919, now seen corresponding path program 1 times [2018-09-10 10:22:00,794 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:00,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:00,796 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:01,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:01,336 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:22:01,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:01,354 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:01,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:22:01,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:22:02,086 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:22:02,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:22:02,087 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:02,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:02,087 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:02,087 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:02,088 INFO L87 Difference]: Start difference. First operand 9166 states and 12611 transitions. Second operand 3 states. [2018-09-10 10:22:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:04,249 INFO L93 Difference]: Finished difference Result 17267 states and 23719 transitions. [2018-09-10 10:22:04,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:04,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-09-10 10:22:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:04,288 INFO L225 Difference]: With dead ends: 17267 [2018-09-10 10:22:04,289 INFO L226 Difference]: Without dead ends: 8107 [2018-09-10 10:22:04,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8107 states. [2018-09-10 10:22:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8107 to 8037. [2018-09-10 10:22:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8037 states. [2018-09-10 10:22:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8037 states to 8037 states and 10602 transitions. [2018-09-10 10:22:04,534 INFO L78 Accepts]: Start accepts. Automaton has 8037 states and 10602 transitions. Word has length 210 [2018-09-10 10:22:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:04,535 INFO L480 AbstractCegarLoop]: Abstraction has 8037 states and 10602 transitions. [2018-09-10 10:22:04,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8037 states and 10602 transitions. [2018-09-10 10:22:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-10 10:22:04,560 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:04,560 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:04,560 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1926737049, now seen corresponding path program 1 times [2018-09-10 10:22:04,561 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:04,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:04,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:04,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:04,562 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:04,818 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:22:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 86 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:05,353 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:05,353 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:22:05,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:05,362 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:05,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:05,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:05,936 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:05,936 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:22:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:05,953 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:06,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:22:06,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:22:06,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:22:06,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 5, 5, 5] total 18 [2018-09-10 10:22:06,667 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:06,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:22:06,668 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:22:06,668 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:22:06,669 INFO L87 Difference]: Start difference. First operand 8037 states and 10602 transitions. Second operand 5 states. [2018-09-10 10:22:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:07,327 INFO L93 Difference]: Finished difference Result 14416 states and 18835 transitions. [2018-09-10 10:22:07,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:22:07,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-09-10 10:22:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:07,328 INFO L225 Difference]: With dead ends: 14416 [2018-09-10 10:22:07,328 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:22:07,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 876 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:22:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:22:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:22:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:22:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:22:07,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222 [2018-09-10 10:22:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:07,355 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:22:07,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:22:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:22:07,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:22:07,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:22:07,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,734 WARN L175 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 88 [2018-09-10 10:22:07,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:07,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:08,179 WARN L175 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-09-10 10:22:08,904 WARN L175 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2018-09-10 10:22:09,573 WARN L175 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2018-09-10 10:22:10,012 WARN L175 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2018-09-10 10:22:10,310 WARN L175 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2018-09-10 10:22:10,314 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,314 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,314 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,314 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,314 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:22:10,315 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:22:10,316 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:10,317 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:22:10,318 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,319 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:22:10,320 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,321 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:22:10,322 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:10,323 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:22:10,324 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,325 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:22:10,326 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,327 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:22:10,328 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,329 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:22:10,330 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,331 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,332 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,332 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,332 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:22:10,332 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 538) no Hoare annotation was computed. [2018-09-10 10:22:10,332 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:22:10,332 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:22:10,332 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:10,333 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:22:10,334 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:22:10,335 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:22:10,335 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:22:10,335 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (let ((.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse1 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9))) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse9 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse11 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7)) (.cse13 (and .cse3 .cse4 .cse5 .cse10 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)))) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.cse8 (< 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (or .cse0 .cse6 .cse7 .cse2 .cse8 .cse9) (or .cse0 .cse7 .cse2 (and .cse3 .cse4 .cse5 .cse10) .cse8) (or .cse11 .cse0 .cse6 .cse2 .cse12 .cse8 .cse9) (or .cse11 .cse0 .cse2 .cse12 .cse13) (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) .cse0 (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (not .cse7) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (not .cse11) (not .cse12)) (or .cse0 .cse1 .cse2 .cse6 .cse9) (or .cse11 .cse13 .cse0 .cse2 .cse8)))) [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:10,336 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:10,337 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9))) [2018-09-10 10:22:10,338 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:10,338 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:10,338 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-09-10 10:22:10,338 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:22:10,338 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:10,338 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7))) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) [2018-09-10 10:22:10,339 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:22:10,339 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (and .cse0 .cse1 .cse2) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7) (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (and .cse1 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) .cse2))) [2018-09-10 10:22:10,339 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:10,339 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:10,339 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (and .cse0 .cse1 .cse2) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7) (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (and .cse1 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) .cse2))) [2018-09-10 10:22:10,339 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:22:10,340 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:22:10,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:22:10 BoogieIcfgContainer [2018-09-10 10:22:10,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:22:10,360 INFO L168 Benchmark]: Toolchain (without parser) took 35722.98 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 914.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:10,361 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:22:10,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.45 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:22:10,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:22:10,363 INFO L168 Benchmark]: Boogie Preprocessor took 227.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:10,364 INFO L168 Benchmark]: RCFGBuilder took 3301.55 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: 120.2 MB). Peak memory consumption was 120.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:10,365 INFO L168 Benchmark]: TraceAbstraction took 31367.55 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 482.9 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -375.3 MB). Peak memory consumption was 843.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:10,370 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.45 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 108.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 227.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3301.55 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: 120.2 MB). Peak memory consumption was 120.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31367.55 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 482.9 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -375.3 MB). Peak memory consumption was 843.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 538]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 7))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || 9 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 7) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1))) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 9) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 7)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1236 SDtfs, 4475 SDslu, 839 SDs, 0 SdLazy, 6261 SolverSat, 1514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2363 GetRequests, 2280 SyntacticMatches, 20 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9166occurred 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: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 441 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 271 PreInvPairs, 347 NumberOfFragments, 467 HoareAnnotationTreeSize, 271 FomulaSimplifications, 4252 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3606 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2483 NumberOfCodeBlocks, 2483 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3605 ConstructedInterpolants, 0 QuantifiedInterpolants, 1835249 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2667 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 1065/1116 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label08_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-22-10-387.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label08_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-22-10-387.csv Received shutdown request...