java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:21:40,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:21:40,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:21:40,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:21:40,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:21:40,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:21:40,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:21:40,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:21:40,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:21:40,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:21:40,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:21:40,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:21:40,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:21:40,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:21:40,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:21:40,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:21:40,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:21:40,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:21:40,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:21:40,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:21:40,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:21:40,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:21:40,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:21:40,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:21:40,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:21:40,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:21:40,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:21:40,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:21:40,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:21:40,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:21:40,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:21:40,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:21:40,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:21:40,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:21:40,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:21:40,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:21:40,666 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:21:40,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:21:40,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:21:40,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:21:40,703 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:21:40,703 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:21:40,703 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:21:40,704 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:21:40,704 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:21:40,704 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:21:40,704 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:21:40,705 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:21:40,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:21:40,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:21:40,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:21:40,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:21:40,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:21:40,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:21:40,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:21:40,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:21:40,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:21:40,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:21:40,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:21:40,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:21:40,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:21:40,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:21:40,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:21:40,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:21:40,710 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:21:40,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:21:40,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:21:40,710 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:21:40,711 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:21:40,711 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:21:40,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:21:40,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:21:40,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:21:40,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:21:40,783 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:21:40,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-09-10 10:21:41,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92228c869/398ac8d91e2e4a16aaf10f14aa474023/FLAGff5c337bf [2018-09-10 10:21:41,483 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:21:41,484 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-09-10 10:21:41,498 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92228c869/398ac8d91e2e4a16aaf10f14aa474023/FLAGff5c337bf [2018-09-10 10:21:41,513 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92228c869/398ac8d91e2e4a16aaf10f14aa474023 [2018-09-10 10:21:41,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:21:41,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:21:41,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:41,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:21:41,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:21:41,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:41" (1/1) ... [2018-09-10 10:21:41,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f00c975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:41, skipping insertion in model container [2018-09-10 10:21:41,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:41" (1/1) ... [2018-09-10 10:21:41,744 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:21:42,071 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:42,093 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:21:42,194 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:42,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42 WrapperNode [2018-09-10 10:21:42,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:42,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:42,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:21:42,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:21:42,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:42,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:21:42,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:21:42,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:21:42,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... [2018-09-10 10:21:42,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:21:42,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:21:42,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:21:42,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:21:42,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:21:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:21:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:21:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:21:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:21:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:21:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:21:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:21:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:21:45,958 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:21:45,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:45 BoogieIcfgContainer [2018-09-10 10:21:45,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:21:45,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:21:45,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:21:45,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:21:45,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:21:41" (1/3) ... [2018-09-10 10:21:45,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ad9efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:21:45, skipping insertion in model container [2018-09-10 10:21:45,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:42" (2/3) ... [2018-09-10 10:21:45,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ad9efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:21:45, skipping insertion in model container [2018-09-10 10:21:45,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:45" (3/3) ... [2018-09-10 10:21:45,974 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label10_true-unreach-call_false-termination.c [2018-09-10 10:21:45,984 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:21:45,997 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:21:46,056 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:21:46,057 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:21:46,057 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:21:46,057 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:21:46,058 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:21:46,058 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:21:46,058 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:21:46,058 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:21:46,059 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:21:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:21:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-10 10:21:46,116 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:46,117 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:46,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:21:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1012738640, now seen corresponding path program 1 times [2018-09-10 10:21:46,128 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:46,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:46,179 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:46,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:46,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:21:46,898 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:46,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:46,925 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:46,926 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:46,929 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:21:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:48,902 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-09-10 10:21:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:48,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-09-10 10:21:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:48,925 INFO L225 Difference]: With dead ends: 621 [2018-09-10 10:21:48,925 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:21:48,932 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:21:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:21:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-10 10:21:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-10 10:21:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-09-10 10:21:49,018 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 142 [2018-09-10 10:21:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:49,021 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-09-10 10:21:49,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-09-10 10:21:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-10 10:21:49,029 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:49,030 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:49,030 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:21:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash -611135269, now seen corresponding path program 1 times [2018-09-10 10:21:49,031 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:49,033 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:49,515 WARN L175 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:21:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:49,643 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:49,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:49,644 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:49,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:49,646 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:49,646 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:49,647 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-09-10 10:21:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:51,691 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-09-10 10:21:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:51,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-09-10 10:21:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:51,697 INFO L225 Difference]: With dead ends: 903 [2018-09-10 10:21:51,698 INFO L226 Difference]: Without dead ends: 381 [2018-09-10 10:21:51,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-10 10:21:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-10 10:21:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-10 10:21:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-09-10 10:21:51,733 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 151 [2018-09-10 10:21:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:51,734 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-09-10 10:21:51,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-09-10 10:21:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-10 10:21:51,738 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:51,738 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:51,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:21:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1698203249, now seen corresponding path program 1 times [2018-09-10 10:21:51,739 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:51,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:51,741 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:52,273 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:52,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:52,273 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:52,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:52,274 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:52,274 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:52,275 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-09-10 10:21:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:53,890 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-09-10 10:21:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:53,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-09-10 10:21:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:53,894 INFO L225 Difference]: With dead ends: 901 [2018-09-10 10:21:53,895 INFO L226 Difference]: Without dead ends: 380 [2018-09-10 10:21:53,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-10 10:21:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-09-10 10:21:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-10 10:21:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-09-10 10:21:53,933 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 157 [2018-09-10 10:21:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:53,934 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-09-10 10:21:53,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-09-10 10:21:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-10 10:21:53,938 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:53,939 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:53,939 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:21:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1274583064, now seen corresponding path program 1 times [2018-09-10 10:21:53,941 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:53,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:53,942 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:54,137 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:54,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:21:54,137 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:54,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:54,138 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:54,138 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:21:54,138 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-09-10 10:21:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:57,023 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-09-10 10:21:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:57,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-09-10 10:21:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:57,029 INFO L225 Difference]: With dead ends: 1193 [2018-09-10 10:21:57,029 INFO L226 Difference]: Without dead ends: 819 [2018-09-10 10:21:57,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:21:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-10 10:21:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-09-10 10:21:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-09-10 10:21:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-09-10 10:21:57,066 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 165 [2018-09-10 10:21:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:57,067 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-09-10 10:21:57,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-09-10 10:21:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-10 10:21:57,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:57,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:57,072 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:21:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2035633068, now seen corresponding path program 1 times [2018-09-10 10:21:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:57,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:57,073 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:57,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:57,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:57,371 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:57,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:57,372 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:57,372 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:57,372 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-09-10 10:21:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:58,603 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-09-10 10:21:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:58,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2018-09-10 10:21:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:58,610 INFO L225 Difference]: With dead ends: 1753 [2018-09-10 10:21:58,611 INFO L226 Difference]: Without dead ends: 804 [2018-09-10 10:21:58,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-09-10 10:21:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-09-10 10:21:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-09-10 10:21:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-09-10 10:21:58,648 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 167 [2018-09-10 10:21:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:58,649 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-09-10 10:21:58,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-09-10 10:21:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-10 10:21:58,653 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:58,654 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:58,654 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:21:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 435949712, now seen corresponding path program 1 times [2018-09-10 10:21:58,654 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:58,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:58,656 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:59,031 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:59,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:59,031 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:59,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:59,032 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:59,033 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:59,033 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-09-10 10:22:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:00,024 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-09-10 10:22:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:22:00,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-09-10 10:22:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:00,029 INFO L225 Difference]: With dead ends: 1747 [2018-09-10 10:22:00,030 INFO L226 Difference]: Without dead ends: 801 [2018-09-10 10:22:00,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:22:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-09-10 10:22:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-09-10 10:22:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-09-10 10:22:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-09-10 10:22:00,057 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 169 [2018-09-10 10:22:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:00,057 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-09-10 10:22:00,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:22:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-09-10 10:22:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-10 10:22:00,062 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:00,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:00,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 322734344, now seen corresponding path program 1 times [2018-09-10 10:22:00,063 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:00,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:00,064 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:00,218 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:00,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:22:00,218 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:00,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:22:00,219 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:22:00,219 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:22:00,220 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-09-10 10:22:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:02,043 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-09-10 10:22:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:22:02,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2018-09-10 10:22:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:02,054 INFO L225 Difference]: With dead ends: 2381 [2018-09-10 10:22:02,055 INFO L226 Difference]: Without dead ends: 1586 [2018-09-10 10:22:02,060 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:22:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-09-10 10:22:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-09-10 10:22:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-09-10 10:22:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-09-10 10:22:02,111 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 173 [2018-09-10 10:22:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:02,111 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-09-10 10:22:02,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:22:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-09-10 10:22:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-10 10:22:02,118 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:02,119 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:02,119 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:02,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1456396321, now seen corresponding path program 1 times [2018-09-10 10:22:02,119 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:02,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:02,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:02,121 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:22:02,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:02,378 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:22:02,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:02,388 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:02,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:02,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:03,125 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:22:03,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-09-10 10:22:03,126 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:03,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:03,127 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:03,127 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:03,127 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-09-10 10:22:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:04,945 INFO L93 Difference]: Finished difference Result 3798 states and 5500 transitions. [2018-09-10 10:22:04,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:04,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2018-09-10 10:22:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:04,960 INFO L225 Difference]: With dead ends: 3798 [2018-09-10 10:22:04,960 INFO L226 Difference]: Without dead ends: 2246 [2018-09-10 10:22:04,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-09-10 10:22:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2018-09-10 10:22:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-10 10:22:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3096 transitions. [2018-09-10 10:22:05,027 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3096 transitions. Word has length 179 [2018-09-10 10:22:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:05,028 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 3096 transitions. [2018-09-10 10:22:05,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3096 transitions. [2018-09-10 10:22:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-10 10:22:05,038 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:05,039 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:05,039 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1905314776, now seen corresponding path program 1 times [2018-09-10 10:22:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:05,041 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:05,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:05,229 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:22:05,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:05,237 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:05,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-10 10:22:05,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-10 10:22:06,024 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:22:06,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-09-10 10:22:06,024 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:06,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:06,025 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:06,026 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:22:06,026 INFO L87 Difference]: Start difference. First operand 2246 states and 3096 transitions. Second operand 3 states. [2018-09-10 10:22:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:07,293 INFO L93 Difference]: Finished difference Result 4487 states and 6220 transitions. [2018-09-10 10:22:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:07,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-09-10 10:22:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:07,308 INFO L225 Difference]: With dead ends: 4487 [2018-09-10 10:22:07,308 INFO L226 Difference]: Without dead ends: 2247 [2018-09-10 10:22:07,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:22:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2018-09-10 10:22:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2242. [2018-09-10 10:22:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2018-09-10 10:22:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2984 transitions. [2018-09-10 10:22:07,381 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2984 transitions. Word has length 208 [2018-09-10 10:22:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:07,382 INFO L480 AbstractCegarLoop]: Abstraction has 2242 states and 2984 transitions. [2018-09-10 10:22:07,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2984 transitions. [2018-09-10 10:22:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-10 10:22:07,393 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:07,393 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:07,393 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 823053720, now seen corresponding path program 1 times [2018-09-10 10:22:07,395 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:07,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:07,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:07,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:07,397 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:07,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:07,880 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:22:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:07,899 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:08,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:08,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:08,587 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:22:08,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:22:08,587 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:08,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:08,588 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:08,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:08,589 INFO L87 Difference]: Start difference. First operand 2242 states and 2984 transitions. Second operand 3 states. [2018-09-10 10:22:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:09,396 INFO L93 Difference]: Finished difference Result 5995 states and 8133 transitions. [2018-09-10 10:22:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:09,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-09-10 10:22:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:09,415 INFO L225 Difference]: With dead ends: 5995 [2018-09-10 10:22:09,416 INFO L226 Difference]: Without dead ends: 3759 [2018-09-10 10:22:09,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2018-09-10 10:22:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3754. [2018-09-10 10:22:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2018-09-10 10:22:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4865 transitions. [2018-09-10 10:22:09,515 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4865 transitions. Word has length 211 [2018-09-10 10:22:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:09,516 INFO L480 AbstractCegarLoop]: Abstraction has 3754 states and 4865 transitions. [2018-09-10 10:22:09,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4865 transitions. [2018-09-10 10:22:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-10 10:22:09,531 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:09,531 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:22:09,532 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1136316192, now seen corresponding path program 1 times [2018-09-10 10:22:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:09,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:09,534 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 156 proven. 52 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:22:10,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:10,043 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:22:10,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:10,057 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:10,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:10,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:11,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:11,124 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:22:11,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:11,142 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:11,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 10:22:11,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 10:22:12,057 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:22:12,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 16 [2018-09-10 10:22:12,057 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:12,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:22:12,058 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:22:12,058 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:22:12,058 INFO L87 Difference]: Start difference. First operand 3754 states and 4865 transitions. Second operand 5 states. [2018-09-10 10:22:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:12,696 INFO L93 Difference]: Finished difference Result 7183 states and 9306 transitions. [2018-09-10 10:22:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:22:12,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2018-09-10 10:22:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:12,699 INFO L225 Difference]: With dead ends: 7183 [2018-09-10 10:22:12,700 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:22:12,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1172 GetRequests, 1157 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:22:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:22:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:22:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:22:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:22:12,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2018-09-10 10:22:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:12,720 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:22:12,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:22:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:22:12,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:22:12,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:22:12,994 WARN L175 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:22:13,427 WARN L175 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-09-10 10:22:14,144 WARN L175 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 67 [2018-09-10 10:22:14,511 WARN L175 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-09-10 10:22:14,514 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,514 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,514 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:22:14,515 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:22:14,516 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:14,517 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:22:14,518 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,519 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:22:14,520 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:22:14,521 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:22:14,522 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:14,523 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:22:14,524 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,525 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:22:14,526 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:22:14,527 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:22:14,528 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,529 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:22:14,530 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:22:14,531 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 577) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:22:14,531 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:22:14,532 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:22:14,532 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:22:14,532 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse16 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (.cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse3 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (let ((.cse0 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7))) (.cse15 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse13 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (.cse10 (and .cse3 .cse5 .cse4)) (.cse7 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse9 (not .cse6)) (.cse11 (not .cse2)) (.cse8 (not .cse16)) (.cse14 (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.cse17 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9))) (and (or .cse0 .cse1 .cse2 (and .cse3 (not .cse4) .cse5) .cse6 .cse7 .cse8) (or .cse1 .cse7 .cse9 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) .cse10 .cse11 .cse8) (or .cse0 .cse1 .cse9 .cse11 (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) .cse4) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7)) .cse8) (or .cse1 .cse12 .cse13 .cse14) (or .cse1 .cse12 .cse15 .cse16 .cse13) (or .cse1 .cse12 .cse16 .cse17 .cse15) (or .cse1 .cse12 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse13) (or .cse1 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) .cse10 .cse7 .cse9 .cse11 .cse8) (or .cse14 .cse1 .cse12 .cse17)))) [2018-09-10 10:22:14,532 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:22:14,532 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:22:14,532 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:22:14,533 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:14,534 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9))) [2018-09-10 10:22:14,534 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:14,534 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:14,534 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-09-10 10:22:14,534 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:22:14,534 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:14,534 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) [2018-09-10 10:22:14,535 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:22:14,535 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) 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__a17~0 9)))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 (<= 8 ~__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__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8) (and .cse0 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)))) [2018-09-10 10:22:14,535 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:14,535 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:14,535 INFO L422 ceAbstractionStarter]: At program point L614(line 614) 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__a17~0 9)))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 (<= 8 ~__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__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8) (and .cse0 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)))) [2018-09-10 10:22:14,535 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:22:14,536 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:22:14,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:22:14 BoogieIcfgContainer [2018-09-10 10:22:14,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:22:14,557 INFO L168 Benchmark]: Toolchain (without parser) took 33031.98 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -708.4 MB). Peak memory consumption was 487.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:14,558 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:22:14,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.56 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:22:14,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:22:14,560 INFO L168 Benchmark]: Boogie Preprocessor took 225.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:14,561 INFO L168 Benchmark]: RCFGBuilder took 3397.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:14,562 INFO L168 Benchmark]: TraceAbstraction took 28595.12 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 440.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -33.2 MB). Peak memory consumption was 407.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:14,567 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.22 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 706.56 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 100.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3397.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28595.12 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 440.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -33.2 MB). Peak memory consumption was 407.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 577]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 9) || ((((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 9) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) < 8) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 28.4s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1716 SDtfs, 4518 SDslu, 906 SDs, 0 SdLazy, 6696 SolverSat, 1433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 2368 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3754occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 103 PreInvPairs, 151 NumberOfFragments, 429 HoareAnnotationTreeSize, 103 FomulaSimplifications, 1288 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1009 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3196 NumberOfCodeBlocks, 3196 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4357 ConstructedInterpolants, 0 QuantifiedInterpolants, 3247985 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2533 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 1773/1845 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label10_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-22-14-602.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label10_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-22-14-602.csv Received shutdown request...