java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:18:27,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:18:27,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:18:27,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:18:27,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:18:27,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:18:27,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:18:27,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:18:27,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:18:27,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:18:27,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:18:27,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:18:27,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:18:27,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:18:27,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:18:27,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:18:27,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:18:27,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:18:27,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:18:27,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:18:27,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:18:27,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:18:27,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:18:27,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:18:27,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:18:27,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:18:27,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:18:27,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:18:27,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:18:27,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:18:27,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:18:27,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:18:27,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:18:27,530 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:18:27,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:18:27,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:18:27,532 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:18:27,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:18:27,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:18:27,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:18:27,555 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:18:27,555 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:18:27,556 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:18:27,556 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:18:27,556 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:18:27,556 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:18:27,556 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:18:27,559 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:18:27,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:18:27,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:18:27,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:18:27,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:18:27,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:18:27,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:18:27,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:18:27,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:18:27,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:18:27,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:18:27,563 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:18:27,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:18:27,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:18:27,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:18:27,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:18:27,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:18:27,565 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:18:27,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:18:27,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:18:27,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:18:27,566 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:18:27,566 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:18:27,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:18:27,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:18:27,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:18:27,664 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:18:27,664 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:18:27,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c [2018-09-10 10:18:28,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc638e4a6/6b7714b515304b28872e74bec36ad8ed/FLAGabe9e374b [2018-09-10 10:18:28,350 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:18:28,351 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c [2018-09-10 10:18:28,372 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc638e4a6/6b7714b515304b28872e74bec36ad8ed/FLAGabe9e374b [2018-09-10 10:18:28,399 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc638e4a6/6b7714b515304b28872e74bec36ad8ed [2018-09-10 10:18:28,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:18:28,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:18:28,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:18:28,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:18:28,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:18:28,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:18:28" (1/1) ... [2018-09-10 10:18:28,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8d8a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:28, skipping insertion in model container [2018-09-10 10:18:28,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:18:28" (1/1) ... [2018-09-10 10:18:28,651 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:18:28,923 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:18:28,946 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:18:29,087 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:18:29,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29 WrapperNode [2018-09-10 10:18:29,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:18:29,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:18:29,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:18:29,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:18:29,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:18:29,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:18:29,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:18:29,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:18:29,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... [2018-09-10 10:18:29,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:18:29,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:18:29,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:18:29,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:18:29,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:18:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:18:29,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:18:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:18:29,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:18:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:18:29,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:18:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:18:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:18:32,774 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:18:32,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:18:32 BoogieIcfgContainer [2018-09-10 10:18:32,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:18:32,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:18:32,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:18:32,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:18:32,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:18:28" (1/3) ... [2018-09-10 10:18:32,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed89b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:18:32, skipping insertion in model container [2018-09-10 10:18:32,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:29" (2/3) ... [2018-09-10 10:18:32,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed89b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:18:32, skipping insertion in model container [2018-09-10 10:18:32,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:18:32" (3/3) ... [2018-09-10 10:18:32,792 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label02_true-unreach-call_false-termination.c [2018-09-10 10:18:32,804 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:18:32,817 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:18:32,885 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:18:32,886 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:18:32,886 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:18:32,886 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:18:32,887 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:18:32,887 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:18:32,887 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:18:32,887 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:18:32,887 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:18:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-10 10:18:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-10 10:18:32,931 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:32,932 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:32,933 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1360806637, now seen corresponding path program 1 times [2018-09-10 10:18:32,942 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:32,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:32,993 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:33,524 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:18:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:33,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:33,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:18:33,672 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:33,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:33,695 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:33,696 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:33,699 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-09-10 10:18:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:35,368 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-09-10 10:18:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:35,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-09-10 10:18:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:35,391 INFO L225 Difference]: With dead ends: 550 [2018-09-10 10:18:35,391 INFO L226 Difference]: Without dead ends: 340 [2018-09-10 10:18:35,398 INFO L604 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-09-10 10:18:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-10 10:18:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-10 10:18:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-10 10:18:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-09-10 10:18:35,480 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 97 [2018-09-10 10:18:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:35,481 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-09-10 10:18:35,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-09-10 10:18:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-10 10:18:35,488 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:35,489 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:35,489 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1263362474, now seen corresponding path program 1 times [2018-09-10 10:18:35,490 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:35,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:35,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:35,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:35,492 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:35,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:35,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:18:35,739 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:18:35,741 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:18:35,741 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:18:35,742 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-09-10 10:18:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:37,692 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-09-10 10:18:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:18:37,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-09-10 10:18:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:37,702 INFO L225 Difference]: With dead ends: 1075 [2018-09-10 10:18:37,703 INFO L226 Difference]: Without dead ends: 741 [2018-09-10 10:18:37,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:18:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-09-10 10:18:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-09-10 10:18:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-09-10 10:18:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-09-10 10:18:37,777 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 108 [2018-09-10 10:18:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:37,778 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-09-10 10:18:37,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:18:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-09-10 10:18:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-10 10:18:37,782 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:37,782 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:37,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:37,783 INFO L82 PathProgramCache]: Analyzing trace with hash -505508864, now seen corresponding path program 1 times [2018-09-10 10:18:37,783 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:37,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:37,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:37,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:37,785 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:37,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:37,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:18:37,997 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:38,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:38,002 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:38,003 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:38,003 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 3 states. [2018-09-10 10:18:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:39,959 INFO L93 Difference]: Finished difference Result 2075 states and 3312 transitions. [2018-09-10 10:18:39,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:39,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-09-10 10:18:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:39,979 INFO L225 Difference]: With dead ends: 2075 [2018-09-10 10:18:39,979 INFO L226 Difference]: Without dead ends: 1357 [2018-09-10 10:18:39,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2018-09-10 10:18:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1350. [2018-09-10 10:18:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2018-09-10 10:18:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2010 transitions. [2018-09-10 10:18:40,043 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2010 transitions. Word has length 109 [2018-09-10 10:18:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:40,044 INFO L480 AbstractCegarLoop]: Abstraction has 1350 states and 2010 transitions. [2018-09-10 10:18:40,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2010 transitions. [2018-09-10 10:18:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-10 10:18:40,052 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:40,052 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:40,052 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash -809933603, now seen corresponding path program 1 times [2018-09-10 10:18:40,053 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:40,055 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:40,374 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:18:40,374 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:18:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:40,386 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:18:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:40,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:18:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:41,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:18:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:41,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:18:41,496 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:18:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:41,516 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:18:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:41,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:18:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:41,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:18:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:41,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:18:41,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 13 [2018-09-10 10:18:41,952 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:18:41,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:18:41,954 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:18:41,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:18:41,955 INFO L87 Difference]: Start difference. First operand 1350 states and 2010 transitions. Second operand 9 states. [2018-09-10 10:18:43,634 WARN L175 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-09-10 10:18:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:47,737 INFO L93 Difference]: Finished difference Result 5035 states and 8308 transitions. [2018-09-10 10:18:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-10 10:18:47,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-09-10 10:18:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:47,776 INFO L225 Difference]: With dead ends: 5035 [2018-09-10 10:18:47,776 INFO L226 Difference]: Without dead ends: 3691 [2018-09-10 10:18:47,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 513 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:18:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2018-09-10 10:18:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3651. [2018-09-10 10:18:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3651 states. [2018-09-10 10:18:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 5653 transitions. [2018-09-10 10:18:47,951 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 5653 transitions. Word has length 130 [2018-09-10 10:18:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:47,951 INFO L480 AbstractCegarLoop]: Abstraction has 3651 states and 5653 transitions. [2018-09-10 10:18:47,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:18:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 5653 transitions. [2018-09-10 10:18:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-10 10:18:47,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:47,970 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:47,970 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 390769030, now seen corresponding path program 1 times [2018-09-10 10:18:47,971 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:47,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:47,974 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:48,183 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:48,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:18:48,184 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:48,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:48,185 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:48,185 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:48,185 INFO L87 Difference]: Start difference. First operand 3651 states and 5653 transitions. Second operand 3 states. [2018-09-10 10:18:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:49,251 INFO L93 Difference]: Finished difference Result 10759 states and 17385 transitions. [2018-09-10 10:18:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:49,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-09-10 10:18:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:49,310 INFO L225 Difference]: With dead ends: 10759 [2018-09-10 10:18:49,311 INFO L226 Difference]: Without dead ends: 7119 [2018-09-10 10:18:49,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7119 states. [2018-09-10 10:18:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7119 to 7112. [2018-09-10 10:18:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2018-09-10 10:18:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 10871 transitions. [2018-09-10 10:18:49,615 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 10871 transitions. Word has length 132 [2018-09-10 10:18:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:49,616 INFO L480 AbstractCegarLoop]: Abstraction has 7112 states and 10871 transitions. [2018-09-10 10:18:49,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 10871 transitions. [2018-09-10 10:18:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-10 10:18:49,634 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:49,634 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:18:49,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1649746555, now seen corresponding path program 1 times [2018-09-10 10:18:49,635 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:49,636 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:50,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:18:50,064 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:18:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:50,071 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:18:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:50,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:18:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:18:50,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:18:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:18:50,316 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:18:50,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-09-10 10:18:50,317 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:50,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:50,318 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:50,318 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:18:50,318 INFO L87 Difference]: Start difference. First operand 7112 states and 10871 transitions. Second operand 3 states. [2018-09-10 10:18:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:51,851 INFO L93 Difference]: Finished difference Result 13393 states and 20428 transitions. [2018-09-10 10:18:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:51,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-09-10 10:18:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:51,890 INFO L225 Difference]: With dead ends: 13393 [2018-09-10 10:18:51,891 INFO L226 Difference]: Without dead ends: 6292 [2018-09-10 10:18:51,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:18:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2018-09-10 10:18:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 6111. [2018-09-10 10:18:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6111 states. [2018-09-10 10:18:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 8475 transitions. [2018-09-10 10:18:52,145 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 8475 transitions. Word has length 133 [2018-09-10 10:18:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:52,146 INFO L480 AbstractCegarLoop]: Abstraction has 6111 states and 8475 transitions. [2018-09-10 10:18:52,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 8475 transitions. [2018-09-10 10:18:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-10 10:18:52,163 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:52,164 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:52,164 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1636909287, now seen corresponding path program 1 times [2018-09-10 10:18:52,164 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:52,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:52,166 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:18:52,370 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:52,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:18:52,370 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:52,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:52,371 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:52,371 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:52,372 INFO L87 Difference]: Start difference. First operand 6111 states and 8475 transitions. Second operand 3 states. [2018-09-10 10:18:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:53,307 INFO L93 Difference]: Finished difference Result 10495 states and 14632 transitions. [2018-09-10 10:18:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:53,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-09-10 10:18:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:53,311 INFO L225 Difference]: With dead ends: 10495 [2018-09-10 10:18:53,311 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:18:53,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:18:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:18:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:18:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:18:53,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2018-09-10 10:18:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:53,344 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:18:53,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:18:53,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:18:53,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:18:53,636 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 10:18:54,128 WARN L175 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-09-10 10:18:55,353 WARN L175 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 104 DAG size of output: 51 [2018-09-10 10:18:55,528 WARN L175 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-09-10 10:18:55,714 WARN L175 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-09-10 10:18:55,717 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-09-10 10:18:55,717 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-09-10 10:18:55,717 INFO L426 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,717 INFO L426 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-09-10 10:18:55,718 INFO L426 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,719 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-09-10 10:18:55,720 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-09-10 10:18:55,721 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-09-10 10:18:55,722 INFO L426 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-09-10 10:18:55,723 INFO L426 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-09-10 10:18:55,725 INFO L426 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-09-10 10:18:55,725 INFO L426 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-09-10 10:18:55,725 INFO L426 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-09-10 10:18:55,725 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-09-10 10:18:55,725 INFO L426 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-09-10 10:18:55,725 INFO L426 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,726 INFO L426 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-09-10 10:18:55,727 INFO L426 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,728 INFO L426 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-09-10 10:18:55,729 INFO L426 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-09-10 10:18:55,730 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-09-10 10:18:55,731 INFO L426 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-09-10 10:18:55,732 INFO L426 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-09-10 10:18:55,733 INFO L426 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-09-10 10:18:55,734 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6)) (.cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13)) (.cse7 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (.cse0 (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (.cse10 (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse12 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 4))) (.cse9 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse8 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6)) (.cse11 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1)) (.cse5 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (or .cse6 (and .cse7 .cse1) .cse4) (or .cse3 (and .cse0 .cse1) .cse8) (or .cse6 .cse2 .cse4 .cse5) (or (and .cse9 .cse10) .cse11 .cse12) (or .cse6 (and .cse7 .cse9 .cse1) .cse11) (or (and .cse0 .cse10) .cse3 .cse12) (or (and .cse10 .cse2) .cse5 .cse12) (or (and .cse9 .cse1 .cse2) .cse8 .cse11 .cse5))) [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:18:55,735 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:18:55,736 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:18:55,737 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) [2018-09-10 10:18:55,737 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:18:55,737 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:18:55,737 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1))) [2018-09-10 10:18:55,737 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:18:55,737 INFO L422 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse3 (<= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse5 (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (.cse2 (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (and .cse0 .cse1) (and .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse5 .cse4) (and .cse5 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (and .cse2 .cse4) (and .cse5 .cse2) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1)))) [2018-09-10 10:18:55,737 INFO L426 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-09-10 10:18:55,737 INFO L426 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-09-10 10:18:55,737 INFO L426 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-09-10 10:18:55,738 INFO L422 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse3 (<= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse5 (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (.cse2 (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (and .cse0 .cse1) (and .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse5 .cse4) (and .cse5 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (and .cse2 .cse4) (and .cse5 .cse2) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1)))) [2018-09-10 10:18:55,738 INFO L426 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:18:55,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:18:55 BoogieIcfgContainer [2018-09-10 10:18:55,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:18:55,764 INFO L168 Benchmark]: Toolchain (without parser) took 27349.78 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -339.5 MB). Peak memory consumption was 780.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:18:55,765 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-09-10 10:18:55,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.86 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:18:55,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:18:55,771 INFO L168 Benchmark]: Boogie Preprocessor took 225.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:18:55,772 INFO L168 Benchmark]: RCFGBuilder took 3321.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:18:55,773 INFO L168 Benchmark]: TraceAbstraction took 22986.91 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 338.2 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 362.1 MB). Peak memory consumption was 700.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:18:55,780 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 703.86 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3321.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22986.91 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 338.2 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 362.1 MB). Peak memory consumption was 700.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8) == 13 || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6))) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1))) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && 6 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) && 6 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) == 6) || (4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7) == 1) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 22.8s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1206 SDtfs, 2577 SDslu, 602 SDs, 0 SdLazy, 5828 SolverSat, 1214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 832 GetRequests, 790 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7112occurred in iteration=5, 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.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 252 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 247 PreInvPairs, 343 NumberOfFragments, 371 HoareAnnotationTreeSize, 247 FomulaSimplifications, 3128 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 881 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1625 ConstructedInterpolants, 0 QuantifiedInterpolants, 454163 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1262 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 414/426 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label02_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-18-55-816.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label02_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-18-55-816.csv Received shutdown request...