java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:47:02,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:47:02,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:47:02,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:47:02,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:47:02,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:47:02,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:47:02,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:47:02,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:47:02,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:47:02,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:47:02,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:47:02,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:47:02,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:47:02,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:47:02,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:47:02,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:47:02,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:47:02,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:47:02,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:47:02,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:47:02,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:47:02,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:47:02,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:47:02,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:47:02,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:47:02,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:47:02,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:47:02,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:47:02,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:47:02,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:47:02,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:47:02,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:47:02,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:47:02,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:47:02,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:47:02,245 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-07-24 12:47:02,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:47:02,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:47:02,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:47:02,269 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:47:02,269 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:47:02,270 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:47:02,270 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:47:02,270 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:47:02,270 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:47:02,270 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:47:02,271 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:47:02,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:47:02,272 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:47:02,272 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:47:02,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:47:02,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:47:02,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:47:02,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:47:02,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:47:02,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:47:02,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:47:02,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:47:02,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:47:02,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:47:02,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:47:02,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:47:02,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:47:02,275 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:47:02,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:47:02,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:47:02,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:47:02,275 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:47:02,275 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:47:02,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:47:02,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:47:02,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:47:02,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:47:02,351 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:47:02,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-07-24 12:47:02,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324aeec4a/f6162b5b89b14f1ea7c51bcc5f03843b/FLAG4d4da2a9c [2018-07-24 12:47:03,018 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:47:03,019 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-07-24 12:47:03,050 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324aeec4a/f6162b5b89b14f1ea7c51bcc5f03843b/FLAG4d4da2a9c [2018-07-24 12:47:03,066 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324aeec4a/f6162b5b89b14f1ea7c51bcc5f03843b [2018-07-24 12:47:03,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:47:03,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:47:03,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:47:03,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:47:03,090 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:47:03,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9c81f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03, skipping insertion in model container [2018-07-24 12:47:03,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,340 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:47:03,688 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:47:03,707 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:47:03,827 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:47:03,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03 WrapperNode [2018-07-24 12:47:03,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:47:03,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:47:03,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:47:03,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:47:03,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:47:03,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:47:03,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:47:03,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:47:03,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:03,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:04,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:04,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... [2018-07-24 12:47:04,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:47:04,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:47:04,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:47:04,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:47:04,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:47:04,223 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-24 12:47:04,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-24 12:47:04,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:47:04,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:47:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:47:04,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:47:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:47:04,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:47:07,807 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:47:07,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:47:07 BoogieIcfgContainer [2018-07-24 12:47:07,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:47:07,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:47:07,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:47:07,813 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:47:07,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:47:03" (1/3) ... [2018-07-24 12:47:07,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1811d6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:47:07, skipping insertion in model container [2018-07-24 12:47:07,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:03" (2/3) ... [2018-07-24 12:47:07,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1811d6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:47:07, skipping insertion in model container [2018-07-24 12:47:07,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:47:07" (3/3) ... [2018-07-24 12:47:07,817 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-07-24 12:47:07,835 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:47:07,845 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:47:07,900 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:47:07,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:47:07,901 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:47:07,901 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:47:07,901 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:47:07,901 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:47:07,902 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:47:07,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:47:07,902 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:47:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-24 12:47:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-24 12:47:07,943 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:07,944 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:07,945 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1774074256, now seen corresponding path program 1 times [2018-07-24 12:47:07,954 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:08,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:08,581 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:08,661 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:08,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:47:08,662 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:08,669 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:08,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:08,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:47:08,691 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-24 12:47:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:10,574 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-07-24 12:47:10,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:10,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-07-24 12:47:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:10,599 INFO L225 Difference]: With dead ends: 621 [2018-07-24 12:47:10,599 INFO L226 Difference]: Without dead ends: 382 [2018-07-24 12:47:10,606 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:47:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-24 12:47:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-24 12:47:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-24 12:47:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-07-24 12:47:10,692 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 118 [2018-07-24 12:47:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-07-24 12:47:10,694 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-07-24 12:47:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-24 12:47:10,706 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:10,707 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:10,707 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash -829252101, now seen corresponding path program 1 times [2018-07-24 12:47:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:10,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:10,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:10,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:11,134 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:11,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:11,134 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:11,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:11,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:11,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:11,137 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-07-24 12:47:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:12,906 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-07-24 12:47:12,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:12,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-07-24 12:47:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:12,912 INFO L225 Difference]: With dead ends: 903 [2018-07-24 12:47:12,912 INFO L226 Difference]: Without dead ends: 381 [2018-07-24 12:47:12,916 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-24 12:47:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-24 12:47:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-24 12:47:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-07-24 12:47:12,941 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 127 [2018-07-24 12:47:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-07-24 12:47:12,942 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-07-24 12:47:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-24 12:47:12,945 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:12,945 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:12,946 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 840770223, now seen corresponding path program 1 times [2018-07-24 12:47:12,946 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:12,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:12,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:13,354 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-07-24 12:47:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:13,493 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:13,493 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:13,493 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:13,494 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:13,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:13,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:13,495 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-07-24 12:47:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:15,447 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-07-24 12:47:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:15,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-07-24 12:47:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:15,454 INFO L225 Difference]: With dead ends: 901 [2018-07-24 12:47:15,455 INFO L226 Difference]: Without dead ends: 380 [2018-07-24 12:47:15,457 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-24 12:47:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-24 12:47:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-24 12:47:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-07-24 12:47:15,475 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 133 [2018-07-24 12:47:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:15,475 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-07-24 12:47:15,475 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-07-24 12:47:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-24 12:47:15,478 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:15,478 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:15,478 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1432357944, now seen corresponding path program 1 times [2018-07-24 12:47:15,479 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:15,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:15,674 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:15,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:15,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:15,675 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:15,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:15,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:15,676 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-07-24 12:47:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:19,214 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-07-24 12:47:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:19,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-07-24 12:47:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:19,220 INFO L225 Difference]: With dead ends: 1193 [2018-07-24 12:47:19,220 INFO L226 Difference]: Without dead ends: 819 [2018-07-24 12:47:19,222 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-24 12:47:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-07-24 12:47:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-07-24 12:47:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-07-24 12:47:19,257 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 141 [2018-07-24 12:47:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-07-24 12:47:19,257 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-07-24 12:47:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-24 12:47:19,261 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:19,261 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:19,261 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1072700532, now seen corresponding path program 1 times [2018-07-24 12:47:19,262 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:19,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:19,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:19,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:19,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:19,579 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:19,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:19,580 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:19,580 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:19,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:19,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:19,581 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-07-24 12:47:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:20,840 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-07-24 12:47:20,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:20,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-07-24 12:47:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:20,851 INFO L225 Difference]: With dead ends: 1753 [2018-07-24 12:47:20,851 INFO L226 Difference]: Without dead ends: 804 [2018-07-24 12:47:20,854 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-07-24 12:47:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-07-24 12:47:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-07-24 12:47:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-07-24 12:47:20,879 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 143 [2018-07-24 12:47:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-07-24 12:47:20,879 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-07-24 12:47:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-24 12:47:20,883 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:20,883 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:20,883 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:20,883 INFO L82 PathProgramCache]: Analyzing trace with hash -589337424, now seen corresponding path program 1 times [2018-07-24 12:47:20,884 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:20,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:20,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:20,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:20,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:21,202 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:21,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:21,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:21,203 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:21,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:21,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:21,203 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-07-24 12:47:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:22,349 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-07-24 12:47:22,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:22,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-07-24 12:47:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:22,354 INFO L225 Difference]: With dead ends: 1747 [2018-07-24 12:47:22,355 INFO L226 Difference]: Without dead ends: 801 [2018-07-24 12:47:22,358 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-07-24 12:47:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-07-24 12:47:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-07-24 12:47:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-07-24 12:47:22,380 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 145 [2018-07-24 12:47:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:22,380 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-07-24 12:47:22,380 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-07-24 12:47:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-24 12:47:22,384 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:22,384 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:22,384 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash 916180264, now seen corresponding path program 1 times [2018-07-24 12:47:22,385 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:22,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:22,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:22,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:22,547 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:22,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:22,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:22,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:22,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:22,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:22,549 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-07-24 12:47:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:24,002 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-07-24 12:47:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:24,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-07-24 12:47:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:24,013 INFO L225 Difference]: With dead ends: 2381 [2018-07-24 12:47:24,014 INFO L226 Difference]: Without dead ends: 1586 [2018-07-24 12:47:24,018 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-07-24 12:47:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-07-24 12:47:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-07-24 12:47:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-07-24 12:47:24,081 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 149 [2018-07-24 12:47:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:24,081 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-07-24 12:47:24,082 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-07-24 12:47:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-24 12:47:24,089 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:24,089 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:24,090 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash -920158216, now seen corresponding path program 1 times [2018-07-24 12:47:24,090 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:24,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:24,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:24,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:24,469 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:24,469 INFO L191 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-07-24 12:47:24,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:24,478 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:24,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:24,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:25,165 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:25,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-07-24 12:47:25,165 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:25,166 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:25,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:25,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:47:25,167 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-07-24 12:47:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:27,888 INFO L93 Difference]: Finished difference Result 3799 states and 5522 transitions. [2018-07-24 12:47:27,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:27,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-07-24 12:47:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:27,902 INFO L225 Difference]: With dead ends: 3799 [2018-07-24 12:47:27,903 INFO L226 Difference]: Without dead ends: 2247 [2018-07-24 12:47:27,910 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:47:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2018-07-24 12:47:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2242. [2018-07-24 12:47:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2018-07-24 12:47:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3020 transitions. [2018-07-24 12:47:27,976 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3020 transitions. Word has length 184 [2018-07-24 12:47:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:27,977 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3020 transitions. [2018-07-24 12:47:27,977 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3020 transitions. [2018-07-24 12:47:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-24 12:47:27,985 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:27,986 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 12:47:27,986 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash 366920120, now seen corresponding path program 1 times [2018-07-24 12:47:27,987 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:27,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:27,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:28,450 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:28,450 INFO L191 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-07-24 12:47:28,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:28,466 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:28,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:28,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:28,991 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:28,991 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:47:29,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:29,018 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:29,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 62 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:29,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:29,719 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:47:29,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 8] total 12 [2018-07-24 12:47:29,720 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:47:29,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:29,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:29,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-07-24 12:47:29,722 INFO L87 Difference]: Start difference. First operand 2242 states and 3020 transitions. Second operand 6 states. [2018-07-24 12:47:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:30,985 INFO L93 Difference]: Finished difference Result 6324 states and 8895 transitions. [2018-07-24 12:47:30,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:30,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-07-24 12:47:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:31,013 INFO L225 Difference]: With dead ends: 6324 [2018-07-24 12:47:31,014 INFO L226 Difference]: Without dead ends: 4088 [2018-07-24 12:47:31,029 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 734 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-07-24 12:47:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2018-07-24 12:47:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4021. [2018-07-24 12:47:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2018-07-24 12:47:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5148 transitions. [2018-07-24 12:47:31,141 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5148 transitions. Word has length 187 [2018-07-24 12:47:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:31,142 INFO L471 AbstractCegarLoop]: Abstraction has 4021 states and 5148 transitions. [2018-07-24 12:47:31,142 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5148 transitions. [2018-07-24 12:47:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-24 12:47:31,154 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:31,154 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:47:31,154 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash 497687535, now seen corresponding path program 1 times [2018-07-24 12:47:31,155 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:31,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:31,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:31,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:31,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:31,466 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:31,466 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:47:31,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:31,491 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:31,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:31,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:32,089 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:47:32,197 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:47:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:32,496 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:32,496 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:47:32,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:32,512 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:32,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:32,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:32,944 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:47:33,045 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:47:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:33,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:47:33,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 16 [2018-07-24 12:47:33,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:47:33,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 12:47:33,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 12:47:33,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-07-24 12:47:33,383 INFO L87 Difference]: Start difference. First operand 4021 states and 5148 transitions. Second operand 8 states. [2018-07-24 12:47:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:38,840 INFO L93 Difference]: Finished difference Result 14969 states and 21205 transitions. [2018-07-24 12:47:38,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-24 12:47:38,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 202 [2018-07-24 12:47:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:38,872 INFO L225 Difference]: With dead ends: 14969 [2018-07-24 12:47:38,872 INFO L226 Difference]: Without dead ends: 5399 [2018-07-24 12:47:38,941 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-07-24 12:47:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5399 states. [2018-07-24 12:47:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5399 to 5232. [2018-07-24 12:47:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5232 states. [2018-07-24 12:47:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 6012 transitions. [2018-07-24 12:47:39,099 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 6012 transitions. Word has length 202 [2018-07-24 12:47:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 5232 states and 6012 transitions. [2018-07-24 12:47:39,099 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 12:47:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 6012 transitions. [2018-07-24 12:47:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-24 12:47:39,112 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:39,112 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:47:39,112 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash -267999228, now seen corresponding path program 1 times [2018-07-24 12:47:39,113 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:39,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:39,114 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:39,396 WARN L169 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 125 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 12:47:39,547 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:39,547 INFO L191 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-07-24 12:47:39,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:39,555 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:39,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:39,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:39,892 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:39,892 INFO L191 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-07-24 12:47:39,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:39,911 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:40,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 125 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 12:47:40,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 12:47:40,410 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-07-24 12:47:40,411 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 11 [2018-07-24 12:47:40,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:40,411 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:40,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:40,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:47:40,413 INFO L87 Difference]: Start difference. First operand 5232 states and 6012 transitions. Second operand 5 states. [2018-07-24 12:47:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:40,873 INFO L93 Difference]: Finished difference Result 8598 states and 9886 transitions. [2018-07-24 12:47:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:40,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2018-07-24 12:47:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:40,891 INFO L225 Difference]: With dead ends: 8598 [2018-07-24 12:47:40,891 INFO L226 Difference]: Without dead ends: 3377 [2018-07-24 12:47:40,898 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 987 SyntacticMatches, 13 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:47:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2018-07-24 12:47:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 3370. [2018-07-24 12:47:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2018-07-24 12:47:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 3845 transitions. [2018-07-24 12:47:40,994 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 3845 transitions. Word has length 250 [2018-07-24 12:47:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 3370 states and 3845 transitions. [2018-07-24 12:47:40,994 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 3845 transitions. [2018-07-24 12:47:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-24 12:47:41,005 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:41,005 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 12:47:41,006 INFO L414 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:41,006 INFO L82 PathProgramCache]: Analyzing trace with hash -764260513, now seen corresponding path program 1 times [2018-07-24 12:47:41,006 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:41,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:41,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:42,001 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:42,001 INFO L191 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-07-24 12:47:42,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:42,010 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:42,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-07-24 12:47:42,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-07-24 12:47:42,763 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:42,763 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:47:42,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:42,779 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:43,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 242 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:43,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 150 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:45,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:47:45,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6, 13, 14] total 44 [2018-07-24 12:47:45,278 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:47:45,279 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-24 12:47:45,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-24 12:47:45,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1656, Unknown=0, NotChecked=0, Total=1892 [2018-07-24 12:47:45,280 INFO L87 Difference]: Start difference. First operand 3370 states and 3845 transitions. Second operand 20 states. [2018-07-24 12:47:45,471 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-07-24 12:47:45,705 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2018-07-24 12:47:45,912 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-07-24 12:47:46,057 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2018-07-24 12:47:46,539 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-07-24 12:47:46,750 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-07-24 12:47:47,556 WARN L169 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-07-24 12:47:47,791 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2018-07-24 12:47:48,350 WARN L169 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2018-07-24 12:47:48,934 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2018-07-24 12:47:49,979 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2018-07-24 12:47:51,212 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 23 [2018-07-24 12:47:51,913 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2018-07-24 12:47:52,680 WARN L169 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2018-07-24 12:47:53,085 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-07-24 12:47:53,439 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-07-24 12:47:54,394 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2018-07-24 12:47:55,231 WARN L169 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2018-07-24 12:47:55,628 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-07-24 12:47:55,881 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-07-24 12:47:57,585 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2018-07-24 12:47:57,740 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-07-24 12:47:59,323 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 25 [2018-07-24 12:48:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:48:00,080 INFO L93 Difference]: Finished difference Result 7128 states and 8816 transitions. [2018-07-24 12:48:00,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-24 12:48:00,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 268 [2018-07-24 12:48:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:48:00,082 INFO L225 Difference]: With dead ends: 7128 [2018-07-24 12:48:00,082 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 12:48:00,103 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1183 GetRequests, 1074 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3472 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2078, Invalid=9694, Unknown=0, NotChecked=0, Total=11772 [2018-07-24 12:48:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 12:48:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 12:48:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 12:48:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 12:48:00,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2018-07-24 12:48:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:48:00,105 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 12:48:00,105 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-24 12:48:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 12:48:00,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 12:48:00,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 12:48:00,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,929 WARN L169 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 212 [2018-07-24 12:48:00,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:00,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:48:01,675 WARN L169 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 212 [2018-07-24 12:48:03,775 WARN L169 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 208 DAG size of output: 67 [2018-07-24 12:48:05,388 WARN L169 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 208 DAG size of output: 67 [2018-07-24 12:48:07,174 WARN L169 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 203 DAG size of output: 79 [2018-07-24 12:48:07,202 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L203''(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L417'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L429'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:48:07,203 INFO L421 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L501'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L513'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L525'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,204 INFO L421 ceAbstractionStarter]: For program point L537'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L549'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L507'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L519'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L504'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L516'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L528'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L238''(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-07-24 12:48:07,205 INFO L421 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-07-24 12:48:07,206 INFO L417 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse20 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (.cse21 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse23 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse24 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse22 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|))) (let ((.cse6 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse8 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (.cse7 (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) .cse23 .cse24 .cse22)) (.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.cse5 (< 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse1 (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) .cse22 .cse23 .cse24 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) (.cse14 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse10 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse13 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse18 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse19 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7))) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse15 (not .cse21)) (.cse16 (not .cse20)) (.cse11 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse9 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7))) (.cse17 (not .cse3))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse9 .cse6) (or .cse0 (not .cse4) (and .cse10 .cse11 .cse12 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse16 .cse8 .cse5 .cse1) (or .cse0 .cse3 .cse9 .cse18 .cse6) (or .cse0 .cse14 .cse1 .cse15 .cse3 .cse16) (or .cse19 .cse0 .cse20 (and .cse10 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not .cse13) .cse11) .cse21 .cse14 .cse17) (or .cse0 .cse21 .cse2 .cse16 .cse8 .cse5 .cse1) (or .cse0 .cse7 .cse16 .cse4 .cse9) (or .cse0 .cse21 .cse2 .cse3 .cse16 .cse5 .cse1) (or .cse0 .cse14 .cse15 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (and .cse10 .cse11 .cse12 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse13) .cse16 .cse17) (or .cse0 .cse18 .cse3 .cse16 .cse9) (or .cse19 .cse0 .cse15 .cse16 .cse11 .cse9 .cse17)))) [2018-07-24 12:48:07,206 INFO L421 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-07-24 12:48:07,206 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-07-24 12:48:07,206 INFO L421 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-07-24 12:48:07,206 INFO L421 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-07-24 12:48:07,206 INFO L421 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L480'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L492'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,207 INFO L421 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-07-24 12:48:07,208 INFO L421 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-07-24 12:48:07,209 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-07-24 12:48:07,210 INFO L421 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L332''(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:48:07,211 INFO L421 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-07-24 12:48:07,212 INFO L421 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION(line 505) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L570'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L582'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,213 INFO L421 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L594'(lines 594 596) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-07-24 12:48:07,214 INFO L421 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L298''(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L591'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-07-24 12:48:07,215 INFO L421 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L471'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L483'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,216 INFO L421 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L495'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-07-24 12:48:07,217 INFO L421 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L561'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L573'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L585'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,218 INFO L421 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L477'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L489'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L441'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,219 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L453'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L465'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-07-24 12:48:07,220 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L75''(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L450'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L462'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L474'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L486'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-07-24 12:48:07,221 INFO L421 ceAbstractionStarter]: For program point L498'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-07-24 12:48:07,222 INFO L421 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L420'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L432'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L414''(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L381''(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-07-24 12:48:07,223 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L83''(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L543'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L555'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L567'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L579'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,224 INFO L421 ceAbstractionStarter]: For program point L576'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L588'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L540'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L552'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L564'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L444'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L456'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L468'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,225 INFO L421 ceAbstractionStarter]: For program point L338''(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L315''(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L262''(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L510'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L522'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L534'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L546'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L558'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,226 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L426'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L438'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L531'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L423'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,227 INFO L421 ceAbstractionStarter]: For program point L435'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point L447'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point L459'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) [2018-07-24 12:48:07,228 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:48:07,228 INFO L417 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-07-24 12:48:07,229 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 12:48:07,229 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:48:07,229 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:48:07,229 INFO L421 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-07-24 12:48:07,229 INFO L421 ceAbstractionStarter]: For program point L606'''(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:48:07,229 INFO L417 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse7 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse8 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse12 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|))) (or (and .cse0 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse1 .cse2 .cse3) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (and .cse4 .cse5 .cse6 .cse7 .cse3) (and .cse8 .cse1 .cse2 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse3) (and .cse8 .cse0 .cse4 (not .cse3) .cse1) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) .cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) .cse9) (and .cse10 .cse5 .cse7) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (< 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse8 .cse1 .cse2 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse3) (and .cse11 (and .cse12 .cse7 .cse3 .cse9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (and .cse11 (and .cse4 .cse7 .cse3 .cse9)) (and .cse5 .cse6 .cse3 .cse9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse8 .cse2 (and .cse12 .cse3 .cse9)) (and .cse11 (and .cse10 .cse6 .cse12 .cse9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9))) [2018-07-24 12:48:07,230 INFO L417 ceAbstractionStarter]: At program point L606''(lines 606 616) the Hoare annotation is: (let ((.cse0 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse7 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse8 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse12 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|))) (or (and .cse0 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse1 .cse2 .cse3) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (and .cse4 .cse5 .cse6 .cse7 .cse3) (and .cse8 .cse1 .cse2 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse3) (and .cse8 .cse0 .cse4 (not .cse3) .cse1) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) .cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) .cse9) (and .cse10 .cse5 .cse7) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (< 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse8 .cse1 .cse2 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse3) (and .cse11 (and .cse12 .cse7 .cse3 .cse9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (and .cse11 (and .cse4 .cse7 .cse3 .cse9)) (and .cse5 .cse6 .cse3 .cse9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse8 .cse2 (and .cse12 .cse3 .cse9)) (and .cse11 (and .cse10 .cse6 .cse12 .cse9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9))) [2018-07-24 12:48:07,230 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:48:07,230 INFO L417 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (< 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) [2018-07-24 12:48:07,230 INFO L421 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-07-24 12:48:07,230 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 616) no Hoare annotation was computed. [2018-07-24 12:48:07,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:48:07 BoogieIcfgContainer [2018-07-24 12:48:07,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:48:07,259 INFO L168 Benchmark]: Toolchain (without parser) took 64180.92 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -504.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-24 12:48:07,260 INFO L168 Benchmark]: CDTParser took 0.26 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-07-24 12:48:07,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-24 12:48:07,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:48:07,261 INFO L168 Benchmark]: Boogie Preprocessor took 189.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -860.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2018-07-24 12:48:07,262 INFO L168 Benchmark]: RCFGBuilder took 3667.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.7 MB). Peak memory consumption was 132.7 MB. Max. memory is 7.1 GB. [2018-07-24 12:48:07,263 INFO L168 Benchmark]: TraceAbstraction took 59449.00 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 708.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 190.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-07-24 12:48:07,267 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.26 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 778.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -860.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3667.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.7 MB). Peak memory consumption was 132.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59449.00 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 708.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 190.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == 1)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11)) || ((((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 7) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || 10 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 9) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 7 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || ((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 9 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 59.3s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 38.0s AutomataDifference, 0.0s DeadEndRemovalTime, 7.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1537 SDtfs, 9601 SDslu, 1769 SDs, 0 SdLazy, 15810 SolverSat, 3219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4229 GetRequests, 3995 SyntacticMatches, 37 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3911 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5232occurred 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: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 286 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 304 PreInvPairs, 672 NumberOfFragments, 969 HoareAnnotationTreeSize, 304 FomulaSimplifications, 37774 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12838 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 4045 NumberOfCodeBlocks, 4045 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6013 ConstructedInterpolants, 0 QuantifiedInterpolants, 5511957 SizeOfPredicates, 22 NumberOfNonLiveVariables, 4475 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 3267/3530 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label39_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-48-07-286.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label39_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-48-07-286.csv Received shutdown request...