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/Problem16_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:17:21,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:17:21,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:17:21,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:17:21,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:17:21,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:17:21,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:17:21,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:17:21,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:17:21,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:17:21,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:17:21,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:17:21,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:17:21,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:17:21,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:17:21,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:17:21,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:17:21,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:17:21,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:17:21,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:17:21,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:17:21,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:17:21,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:17:21,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:17:21,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:17:21,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:17:21,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:17:21,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:17:21,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:17:21,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:17:21,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:17:21,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:17:21,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:17:21,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:17:21,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:17:21,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:17:21,965 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 12:17:21,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:17:21,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:17:21,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:17:21,996 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:17:21,996 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:17:21,997 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:17:21,997 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:17:21,997 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:17:21,997 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:17:21,997 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:17:21,998 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:17:21,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:17:21,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:17:22,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:17:22,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:17:22,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:17:22,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:17:22,002 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:17:22,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:17:22,003 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:17:22,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:17:22,003 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:17:22,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:17:22,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:17:22,004 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:17:22,004 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:17:22,004 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:17:22,005 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:17:22,005 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:17:22,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:17:22,005 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:17:22,005 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:17:22,006 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:17:22,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:17:22,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:17:22,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:17:22,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:17:22,096 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:17:22,097 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label11_true-unreach-call.c [2018-09-10 12:17:22,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfaa31d5/fe94c1e8762b48d3b383a9fda28bf471/FLAG46ce4a24a [2018-09-10 12:17:22,833 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:17:22,834 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label11_true-unreach-call.c [2018-09-10 12:17:22,857 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfaa31d5/fe94c1e8762b48d3b383a9fda28bf471/FLAG46ce4a24a [2018-09-10 12:17:22,878 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfaa31d5/fe94c1e8762b48d3b383a9fda28bf471 [2018-09-10 12:17:22,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:17:22,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:17:22,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:17:22,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:17:22,901 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:17:22,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:17:22" (1/1) ... [2018-09-10 12:17:22,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39536d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:22, skipping insertion in model container [2018-09-10 12:17:22,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:17:22" (1/1) ... [2018-09-10 12:17:23,161 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:17:23,755 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:17:23,779 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:17:24,047 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:17:24,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24 WrapperNode [2018-09-10 12:17:24,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:17:24,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:17:24,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:17:24,150 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:17:24,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:17:24,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:17:24,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:17:24,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:17:24,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (1/1) ... [2018-09-10 12:17:24,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:17:24,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:17:24,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:17:24,792 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:17:24,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (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 12:17:24,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:17:24,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:17:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 12:17:24,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 12:17:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:17:24,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:17:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:17:24,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:17:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 12:17:24,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 12:17:32,058 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:17:32,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:17:32 BoogieIcfgContainer [2018-09-10 12:17:32,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:17:32,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:17:32,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:17:32,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:17:32,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:17:22" (1/3) ... [2018-09-10 12:17:32,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cf3ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:17:32, skipping insertion in model container [2018-09-10 12:17:32,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:24" (2/3) ... [2018-09-10 12:17:32,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cf3ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:17:32, skipping insertion in model container [2018-09-10 12:17:32,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:17:32" (3/3) ... [2018-09-10 12:17:32,071 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label11_true-unreach-call.c [2018-09-10 12:17:32,081 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:17:32,097 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:17:32,158 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:17:32,159 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:17:32,159 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:17:32,159 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:17:32,159 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:17:32,160 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:17:32,160 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:17:32,160 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:17:32,160 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:17:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-10 12:17:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-10 12:17:32,223 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:32,224 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] [2018-09-10 12:17:32,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash -328920636, now seen corresponding path program 1 times [2018-09-10 12:17:32,235 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:32,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:32,291 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:32,822 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-09-10 12:17:32,841 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 12:17:32,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:32,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:17:32,845 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:32,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:17:32,867 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:17:32,868 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:17:32,871 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-09-10 12:17:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:38,325 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-09-10 12:17:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:17:38,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-09-10 12:17:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:38,357 INFO L225 Difference]: With dead ends: 1513 [2018-09-10 12:17:38,357 INFO L226 Difference]: Without dead ends: 1097 [2018-09-10 12:17:38,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:17:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-09-10 12:17:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-09-10 12:17:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-10 12:17:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-09-10 12:17:38,572 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 62 [2018-09-10 12:17:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:38,573 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-09-10 12:17:38,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:17:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-09-10 12:17:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-10 12:17:38,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:38,581 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:38,582 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1541140530, now seen corresponding path program 1 times [2018-09-10 12:17:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:38,587 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:39,053 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:39,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 12:17:39,054 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:39,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:17:39,057 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:17:39,057 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 12:17:39,057 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-09-10 12:17:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:44,271 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-09-10 12:17:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:44,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-09-10 12:17:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:44,294 INFO L225 Difference]: With dead ends: 2196 [2018-09-10 12:17:44,294 INFO L226 Difference]: Without dead ends: 1458 [2018-09-10 12:17:44,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 12:17:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-09-10 12:17:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-09-10 12:17:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-09-10 12:17:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-09-10 12:17:44,387 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 132 [2018-09-10 12:17:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:44,388 INFO L480 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-09-10 12:17:44,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:17:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-09-10 12:17:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-10 12:17:44,396 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:44,397 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:44,397 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 731160789, now seen corresponding path program 1 times [2018-09-10 12:17:44,402 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:44,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:44,404 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:44,694 WARN L175 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:17:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:44,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:44,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:44,750 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:44,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:44,751 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:44,751 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:44,751 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-09-10 12:17:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:49,040 INFO L93 Difference]: Finished difference Result 3593 states and 6391 transitions. [2018-09-10 12:17:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:49,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-09-10 12:17:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:49,062 INFO L225 Difference]: With dead ends: 3593 [2018-09-10 12:17:49,063 INFO L226 Difference]: Without dead ends: 2161 [2018-09-10 12:17:49,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2018-09-10 12:17:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2141. [2018-09-10 12:17:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2018-09-10 12:17:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3212 transitions. [2018-09-10 12:17:49,207 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3212 transitions. Word has length 135 [2018-09-10 12:17:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:49,209 INFO L480 AbstractCegarLoop]: Abstraction has 2141 states and 3212 transitions. [2018-09-10 12:17:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3212 transitions. [2018-09-10 12:17:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-10 12:17:49,213 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:49,214 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:49,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash 630442253, now seen corresponding path program 1 times [2018-09-10 12:17:49,215 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:49,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:49,217 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:49,511 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:17:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:49,920 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:49,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:49,920 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:49,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:49,921 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:49,922 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:49,922 INFO L87 Difference]: Start difference. First operand 2141 states and 3212 transitions. Second operand 6 states. [2018-09-10 12:17:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:55,104 INFO L93 Difference]: Finished difference Result 6710 states and 10149 transitions. [2018-09-10 12:17:55,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:55,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-09-10 12:17:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:55,128 INFO L225 Difference]: With dead ends: 6710 [2018-09-10 12:17:55,128 INFO L226 Difference]: Without dead ends: 4575 [2018-09-10 12:17:55,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2018-09-10 12:17:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4539. [2018-09-10 12:17:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4539 states. [2018-09-10 12:17:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 6477 transitions. [2018-09-10 12:17:55,270 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 6477 transitions. Word has length 139 [2018-09-10 12:17:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:55,270 INFO L480 AbstractCegarLoop]: Abstraction has 4539 states and 6477 transitions. [2018-09-10 12:17:55,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 6477 transitions. [2018-09-10 12:17:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-10 12:17:55,275 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:55,275 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:55,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:55,275 INFO L82 PathProgramCache]: Analyzing trace with hash 778020390, now seen corresponding path program 1 times [2018-09-10 12:17:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:55,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:55,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:55,280 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:55,577 WARN L175 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:17:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 12:17:55,803 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:17:55,803 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 12:17:55,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:55,821 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:17:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:55,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:17:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:56,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:17:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:56,389 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:17:56,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-09-10 12:17:56,389 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:56,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:17:56,390 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:17:56,391 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:56,391 INFO L87 Difference]: Start difference. First operand 4539 states and 6477 transitions. Second operand 3 states. [2018-09-10 12:18:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:00,325 INFO L93 Difference]: Finished difference Result 10787 states and 15649 transitions. [2018-09-10 12:18:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:00,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-09-10 12:18:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:00,363 INFO L225 Difference]: With dead ends: 10787 [2018-09-10 12:18:00,363 INFO L226 Difference]: Without dead ends: 6254 [2018-09-10 12:18:00,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:18:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2018-09-10 12:18:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2018-09-10 12:18:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6254 states. [2018-09-10 12:18:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 8564 transitions. [2018-09-10 12:18:00,544 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 8564 transitions. Word has length 154 [2018-09-10 12:18:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:00,544 INFO L480 AbstractCegarLoop]: Abstraction has 6254 states and 8564 transitions. [2018-09-10 12:18:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 8564 transitions. [2018-09-10 12:18:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-10 12:18:00,556 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:00,556 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:00,557 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash -11338104, now seen corresponding path program 1 times [2018-09-10 12:18:00,557 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:00,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:00,559 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:00,910 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:18:00,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:18:00,911 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:00,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:18:00,912 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:18:00,912 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:18:00,912 INFO L87 Difference]: Start difference. First operand 6254 states and 8564 transitions. Second operand 4 states. [2018-09-10 12:18:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:06,077 INFO L93 Difference]: Finished difference Result 16244 states and 23027 transitions. [2018-09-10 12:18:06,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:18:06,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-09-10 12:18:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:06,125 INFO L225 Difference]: With dead ends: 16244 [2018-09-10 12:18:06,126 INFO L226 Difference]: Without dead ends: 9996 [2018-09-10 12:18:06,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:18:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2018-09-10 12:18:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 9996. [2018-09-10 12:18:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2018-09-10 12:18:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 13292 transitions. [2018-09-10 12:18:06,531 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 13292 transitions. Word has length 326 [2018-09-10 12:18:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:06,532 INFO L480 AbstractCegarLoop]: Abstraction has 9996 states and 13292 transitions. [2018-09-10 12:18:06,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:18:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 13292 transitions. [2018-09-10 12:18:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-09-10 12:18:06,547 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:06,548 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:18:06,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:06,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2022826879, now seen corresponding path program 1 times [2018-09-10 12:18:06,549 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:06,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:06,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:06,550 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:07,137 WARN L175 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-10 12:18:07,555 WARN L175 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-09-10 12:18:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 269 proven. 69 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-10 12:18:08,145 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:08,145 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:08,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:08,154 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:08,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-09-10 12:18:08,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-09-10 12:18:08,535 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:08,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 12 [2018-09-10 12:18:08,535 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:08,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:08,536 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:08,536 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:18:08,537 INFO L87 Difference]: Start difference. First operand 9996 states and 13292 transitions. Second operand 3 states. [2018-09-10 12:18:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:11,993 INFO L93 Difference]: Finished difference Result 19986 states and 26592 transitions. [2018-09-10 12:18:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:11,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2018-09-10 12:18:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:12,043 INFO L225 Difference]: With dead ends: 19986 [2018-09-10 12:18:12,044 INFO L226 Difference]: Without dead ends: 9996 [2018-09-10 12:18:12,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 725 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:18:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2018-09-10 12:18:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 9320. [2018-09-10 12:18:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2018-09-10 12:18:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 12104 transitions. [2018-09-10 12:18:12,257 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 12104 transitions. Word has length 363 [2018-09-10 12:18:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:12,258 INFO L480 AbstractCegarLoop]: Abstraction has 9320 states and 12104 transitions. [2018-09-10 12:18:12,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 12104 transitions. [2018-09-10 12:18:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-09-10 12:18:12,274 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:12,275 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:12,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -95187337, now seen corresponding path program 1 times [2018-09-10 12:18:12,276 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:12,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:12,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:12,277 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:12,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:12,830 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 12:18:12,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:12,839 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:12,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:13,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:13,605 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:13,605 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:13,621 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:13,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:14,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:14,284 WARN L175 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-10 12:18:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:14,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:14,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:18:14,464 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:14,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:14,465 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:14,465 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:18:14,468 INFO L87 Difference]: Start difference. First operand 9320 states and 12104 transitions. Second operand 9 states. [2018-09-10 12:18:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:21,702 INFO L93 Difference]: Finished difference Result 20309 states and 27370 transitions. [2018-09-10 12:18:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-10 12:18:21,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 387 [2018-09-10 12:18:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:21,755 INFO L225 Difference]: With dead ends: 20309 [2018-09-10 12:18:21,756 INFO L226 Difference]: Without dead ends: 10995 [2018-09-10 12:18:21,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1572 GetRequests, 1546 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-09-10 12:18:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10995 states. [2018-09-10 12:18:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10995 to 10768. [2018-09-10 12:18:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10768 states. [2018-09-10 12:18:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10768 states to 10768 states and 12844 transitions. [2018-09-10 12:18:22,076 INFO L78 Accepts]: Start accepts. Automaton has 10768 states and 12844 transitions. Word has length 387 [2018-09-10 12:18:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:22,078 INFO L480 AbstractCegarLoop]: Abstraction has 10768 states and 12844 transitions. [2018-09-10 12:18:22,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 10768 states and 12844 transitions. [2018-09-10 12:18:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-09-10 12:18:22,107 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:22,107 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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] [2018-09-10 12:18:22,107 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash 251555032, now seen corresponding path program 1 times [2018-09-10 12:18:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:22,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:22,109 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:22,811 WARN L175 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-10 12:18:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 76 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:18:23,698 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:23,699 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 12:18:23,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:23,708 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:23,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-09-10 12:18:24,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-09-10 12:18:24,803 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:24,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-09-10 12:18:24,804 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:24,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:24,805 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:24,805 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 12:18:24,805 INFO L87 Difference]: Start difference. First operand 10768 states and 12844 transitions. Second operand 3 states. [2018-09-10 12:18:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:28,789 INFO L93 Difference]: Finished difference Result 24905 states and 29576 transitions. [2018-09-10 12:18:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:28,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 526 [2018-09-10 12:18:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:28,834 INFO L225 Difference]: With dead ends: 24905 [2018-09-10 12:18:28,835 INFO L226 Difference]: Without dead ends: 14148 [2018-09-10 12:18:28,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1053 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 12:18:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2018-09-10 12:18:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 13804. [2018-09-10 12:18:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13804 states. [2018-09-10 12:18:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 16135 transitions. [2018-09-10 12:18:29,089 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 16135 transitions. Word has length 526 [2018-09-10 12:18:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:29,090 INFO L480 AbstractCegarLoop]: Abstraction has 13804 states and 16135 transitions. [2018-09-10 12:18:29,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 16135 transitions. [2018-09-10 12:18:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2018-09-10 12:18:29,132 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:29,132 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:29,133 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -976769904, now seen corresponding path program 1 times [2018-09-10 12:18:29,133 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:29,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:29,135 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:18:29,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:29,995 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:30,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:30,009 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:30,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:18:30,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:18:30,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:30,945 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:30,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:30,961 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:31,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:18:31,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:18:32,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:32,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-09-10 12:18:32,138 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:32,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:32,139 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:32,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:18:32,140 INFO L87 Difference]: Start difference. First operand 13804 states and 16135 transitions. Second operand 9 states. [2018-09-10 12:18:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:42,804 INFO L93 Difference]: Finished difference Result 39410 states and 46538 transitions. [2018-09-10 12:18:42,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-10 12:18:42,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 644 [2018-09-10 12:18:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:42,855 INFO L225 Difference]: With dead ends: 39410 [2018-09-10 12:18:42,855 INFO L226 Difference]: Without dead ends: 19952 [2018-09-10 12:18:42,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2648 GetRequests, 2599 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=516, Invalid=1934, Unknown=0, NotChecked=0, Total=2450 [2018-09-10 12:18:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19952 states. [2018-09-10 12:18:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19952 to 19327. [2018-09-10 12:18:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19327 states. [2018-09-10 12:18:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19327 states to 19327 states and 20377 transitions. [2018-09-10 12:18:43,191 INFO L78 Accepts]: Start accepts. Automaton has 19327 states and 20377 transitions. Word has length 644 [2018-09-10 12:18:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:43,192 INFO L480 AbstractCegarLoop]: Abstraction has 19327 states and 20377 transitions. [2018-09-10 12:18:43,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19327 states and 20377 transitions. [2018-09-10 12:18:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2018-09-10 12:18:43,207 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:43,208 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:18:43,208 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:43,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1066980292, now seen corresponding path program 1 times [2018-09-10 12:18:43,209 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:43,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:43,210 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:43,677 WARN L175 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:18:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 508 proven. 278 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 12:18:45,096 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:45,096 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:45,104 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:45,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-09-10 12:18:45,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-09-10 12:18:45,749 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:45,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-10 12:18:45,750 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:45,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:45,751 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:45,752 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:45,752 INFO L87 Difference]: Start difference. First operand 19327 states and 20377 transitions. Second operand 3 states. [2018-09-10 12:18:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:47,066 INFO L93 Difference]: Finished difference Result 38307 states and 40393 transitions. [2018-09-10 12:18:47,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:47,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 670 [2018-09-10 12:18:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:47,102 INFO L225 Difference]: With dead ends: 38307 [2018-09-10 12:18:47,103 INFO L226 Difference]: Without dead ends: 19327 [2018-09-10 12:18:47,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1353 GetRequests, 1341 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19327 states. [2018-09-10 12:18:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19327 to 18643. [2018-09-10 12:18:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18643 states. [2018-09-10 12:18:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18643 states to 18643 states and 19453 transitions. [2018-09-10 12:18:47,405 INFO L78 Accepts]: Start accepts. Automaton has 18643 states and 19453 transitions. Word has length 670 [2018-09-10 12:18:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:47,406 INFO L480 AbstractCegarLoop]: Abstraction has 18643 states and 19453 transitions. [2018-09-10 12:18:47,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18643 states and 19453 transitions. [2018-09-10 12:18:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2018-09-10 12:18:47,444 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:47,445 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 12:18:47,445 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash 54400539, now seen corresponding path program 1 times [2018-09-10 12:18:47,446 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:47,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:47,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:47,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:47,447 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 1748 trivial. 0 not checked. [2018-09-10 12:18:48,913 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:18:48,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:18:48,913 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:48,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:18:48,914 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:18:48,915 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:18:48,915 INFO L87 Difference]: Start difference. First operand 18643 states and 19453 transitions. Second operand 4 states. [2018-09-10 12:18:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:52,595 INFO L93 Difference]: Finished difference Result 39295 states and 41327 transitions. [2018-09-10 12:18:52,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:18:52,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1077 [2018-09-10 12:18:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:52,597 INFO L225 Difference]: With dead ends: 39295 [2018-09-10 12:18:52,597 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:18:52,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:18:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:18:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:18:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:18:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:18:52,638 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1077 [2018-09-10 12:18:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:52,638 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:18:52,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:18:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:18:52,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:18:52,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:18:52,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:52,957 WARN L175 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 191 [2018-09-10 12:18:53,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:18:53,651 WARN L175 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 191 [2018-09-10 12:18:54,254 WARN L175 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2018-09-10 12:18:55,392 WARN L175 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 182 DAG size of output: 63 [2018-09-10 12:18:55,507 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2018-09-10 12:19:00,509 WARN L175 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 231 DAG size of output: 69 [2018-09-10 12:19:01,268 WARN L175 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 63 [2018-09-10 12:19:03,077 WARN L175 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 215 DAG size of output: 68 [2018-09-10 12:19:05,167 WARN L175 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 259 DAG size of output: 68 [2018-09-10 12:19:05,170 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:19:05,170 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_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) [2018-09-10 12:19:05,170 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,171 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,172 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:19:05,172 INFO L426 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,172 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:19:05,172 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:19:05,172 INFO L422 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse14 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (.cse3 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse11 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse16 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (let ((.cse5 (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse13 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse7 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse12 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse6 (not .cse16)) (.cse15 (and .cse17 .cse10 .cse3 .cse11)) (.cse2 (< 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse4 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156) 0)) (.cse1 (not .cse14)) (.cse0 (and .cse17 .cse10 .cse11)) (.cse8 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse9 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 7))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse2) (or .cse6 .cse7 .cse0) (or .cse4 .cse8 .cse9 .cse0) (or .cse5 .cse8 (and .cse10 .cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (or .cse7 .cse12 .cse0) (or .cse0 (or .cse13 .cse1)) (or .cse13 .cse0 .cse7 .cse2) (or .cse13 .cse3 .cse4 .cse7 .cse2) (or .cse4 .cse7 .cse9 .cse14 .cse15 .cse16) (or .cse4 .cse8 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) .cse15) (or .cse3 .cse4 .cse1 .cse12) (or .cse15 .cse6 .cse4 .cse8) (or .cse15 .cse4 .cse8 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| 11) .cse2) (or .cse4 .cse8 .cse1 .cse3) (or .cse0 .cse8 .cse9 .cse14 .cse16)))) [2018-09-10 12:19:05,172 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,172 INFO L426 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,173 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,174 INFO L426 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,175 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,176 INFO L426 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:19:05,177 INFO L426 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,178 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,179 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:19:05,180 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,181 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,182 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:19:05,183 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,184 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,185 INFO L426 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,186 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,187 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,188 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-09-10 12:19:05,189 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,190 INFO L426 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,191 INFO L426 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,192 INFO L426 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,193 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,194 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,195 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:19:05,196 INFO L426 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,197 INFO L426 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,198 INFO L426 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,199 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,200 INFO L426 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L426 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,201 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (.cse3 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse8 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse15 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse16 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (let ((.cse5 (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse12 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse9 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse11 (not .cse16)) (.cse1 (not .cse15)) (.cse10 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse13 (and .cse17 .cse7 .cse3 .cse8)) (.cse4 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156) 0)) (.cse2 (< 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (and .cse17 .cse7 .cse8)) (.cse6 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse14 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 7))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse2) (or .cse5 .cse6 (and .cse7 .cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (or .cse9 .cse10 .cse0) (or .cse11 .cse0 .cse9) (or .cse0 (or .cse12 .cse1)) (or .cse4 .cse6 .cse1 .cse13) (or .cse12 .cse0 .cse9 .cse2) (or .cse12 .cse3 .cse4 .cse9 .cse2) (or .cse4 .cse9 .cse14 .cse15 .cse13 .cse16) (or .cse4 .cse6 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) .cse13) (or .cse13 .cse11 .cse4 .cse6) (or .cse3 .cse4 .cse1 .cse10) (or .cse13 .cse4 .cse6 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| 11) .cse2) (or .cse0 .cse6 .cse14 .cse15 .cse16)))) [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:19:05,202 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_c__a15~0 4)) (<= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 87)) (<= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) [2018-09-10 12:19:05,202 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:19:05,202 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87) 0) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (<= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 87)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| 11)) [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:19:05,202 INFO L422 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4))) (.cse0 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7)))) (let ((.cse2 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse3 (and (and .cse4 .cse0) .cse5)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 6)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse6 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse8 (<= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0))) (or (and .cse0 .cse1 .cse2) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| 11) (and .cse1 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) (and (and .cse4 .cse5 .cse2) (not .cse6)) (and .cse6 .cse7) (and .cse1 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10)) (and .cse3 (<= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87) 0) (and .cse8 .cse7 .cse1) (and .cse6 .cse8) (and .cse4 .cse0 (<= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)))) [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2018-09-10 12:19:05,202 INFO L426 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1773-1(lines 1773 1782) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L422 ceAbstractionStarter]: At program point L1773-3(lines 1773 1782) the Hoare annotation is: (let ((.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4))) (.cse0 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7)))) (let ((.cse2 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse3 (and (and .cse4 .cse0) .cse5)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 6)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse6 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse8 (<= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0))) (or (and .cse0 .cse1 .cse2) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| 11) (and .cse1 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) (and (and .cse4 .cse5 .cse2) (not .cse6)) (and .cse6 .cse7) (and .cse1 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10)) (and .cse3 (<= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87) 0) (and .cse8 .cse7 .cse1) (and .cse6 .cse8) (and .cse4 .cse0 (<= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)))) [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1773-4(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,203 INFO L426 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (.cse3 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse8 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse15 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse16 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (let ((.cse5 (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse12 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse9 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse11 (not .cse16)) (.cse1 (not .cse15)) (.cse10 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse13 (and .cse17 .cse7 .cse3 .cse8)) (.cse4 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156) 0)) (.cse2 (< 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (and .cse17 .cse7 .cse8)) (.cse6 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse14 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 7))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse2) (or .cse5 .cse6 (and .cse7 .cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (or .cse9 .cse10 .cse0) (or .cse11 .cse0 .cse9) (or .cse0 (or .cse12 .cse1)) (or .cse4 .cse6 .cse1 .cse13) (or .cse12 .cse0 .cse9 .cse2) (or .cse12 .cse3 .cse4 .cse9 .cse2) (or .cse4 .cse9 .cse14 .cse15 .cse13 .cse16) (or .cse4 .cse6 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) .cse13) (or .cse13 .cse11 .cse4 .cse6) (or .cse3 .cse4 .cse1 .cse10) (or .cse13 .cse4 .cse6 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| 11) .cse2) (or .cse0 .cse6 .cse14 .cse15 .cse16)))) [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,204 INFO L426 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:19:05,205 INFO L426 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,206 INFO L426 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,207 INFO L426 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-09-10 12:19:05,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:19:05 BoogieIcfgContainer [2018-09-10 12:19:05,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:19:05,235 INFO L168 Benchmark]: Toolchain (without parser) took 102345.38 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 12:19:05,236 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:19:05,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1255.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:05,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:05,240 INFO L168 Benchmark]: Boogie Preprocessor took 450.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 828.4 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -985.6 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:05,241 INFO L168 Benchmark]: RCFGBuilder took 7268.02 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 278.4 MB). Peak memory consumption was 278.4 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:05,243 INFO L168 Benchmark]: TraceAbstraction took 93173.71 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -937.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-10 12:19:05,251 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1255.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 191.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 450.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 828.4 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -985.6 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7268.02 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 278.4 MB). Peak memory consumption was 278.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93173.71 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -937.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: 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: 1773]: Loop Invariant Derived loop invariant: ((((((((((((((((0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) || 12 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) < 11) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 5)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || (8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 6)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && 11 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || 5 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18) + 87 < 0) || ((4 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 6) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12))) || (8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 && 4 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156) && 12 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || 4 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. SAFE Result, 93.0s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 60.3s AutomataDifference, 0.0s DeadEndRemovalTime, 12.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2737 SDtfs, 15550 SDslu, 1465 SDs, 0 SdLazy, 28369 SolverSat, 6330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7726 GetRequests, 7587 SyntacticMatches, 18 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19327occurred in iteration=10, 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: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 2985 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 953 PreInvPairs, 1379 NumberOfFragments, 1455 HoareAnnotationTreeSize, 953 FomulaSimplifications, 35971 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 33359 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 8390 NumberOfCodeBlocks, 8390 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 12137 ConstructedInterpolants, 0 QuantifiedInterpolants, 17080164 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5480 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 11866/12537 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/Problem16_label11_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-19-05-290.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label11_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-19-05-290.csv Received shutdown request...