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_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:21:29,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:21:29,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:21:29,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:21:29,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:21:29,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:21:29,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:21:29,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:21:29,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:21:29,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:21:29,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:21:29,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:21:29,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:21:29,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:21:29,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:21:29,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:21:29,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:21:29,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:21:29,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:21:29,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:21:29,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:21:29,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:21:29,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:21:29,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:21:29,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:21:29,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:21:29,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:21:29,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:21:29,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:21:29,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:21:29,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:21:29,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:21:29,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:21:29,431 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:21:29,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:21:29,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:21:29,433 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:29,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:21:29,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:21:29,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:21:29,451 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:21:29,451 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:21:29,451 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:21:29,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:21:29,452 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:21:29,452 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:21:29,452 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:21:29,453 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:21:29,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:21:29,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:21:29,454 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:21:29,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:21:29,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:21:29,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:21:29,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:21:29,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:21:29,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:21:29,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:21:29,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:21:29,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:21:29,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:21:29,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:21:29,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:21:29,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:21:29,457 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:21:29,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:21:29,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:21:29,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:21:29,457 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:21:29,458 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:21:29,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:21:29,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:21:29,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:21:29,522 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:21:29,522 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:21:29,523 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-09-10 10:21:29,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e2e374a/a2d02968a8bf48e9b20f23f6f0a80d76/FLAGbdf8d6bd1 [2018-09-10 10:21:30,122 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:21:30,123 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-09-10 10:21:30,143 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e2e374a/a2d02968a8bf48e9b20f23f6f0a80d76/FLAGbdf8d6bd1 [2018-09-10 10:21:30,165 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e2e374a/a2d02968a8bf48e9b20f23f6f0a80d76 [2018-09-10 10:21:30,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:21:30,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:21:30,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:30,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:21:30,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:21:30,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:30" (1/1) ... [2018-09-10 10:21:30,195 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:30, skipping insertion in model container [2018-09-10 10:21:30,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:30" (1/1) ... [2018-09-10 10:21:30,446 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:21:30,686 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:30,707 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:21:30,883 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:30,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:30 WrapperNode [2018-09-10 10:21:30,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:30,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:30,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:21:30,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:21:30,939 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:30" (1/1) ... [2018-09-10 10:21:30,959 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:30" (1/1) ... [2018-09-10 10:21:31,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:31,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:21:31,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:21:31,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:21:31,138 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:30" (1/1) ... [2018-09-10 10:21:31,139 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:30" (1/1) ... [2018-09-10 10:21:31,143 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:30" (1/1) ... [2018-09-10 10:21:31,144 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:30" (1/1) ... [2018-09-10 10:21:31,163 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:30" (1/1) ... [2018-09-10 10:21:31,178 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:30" (1/1) ... [2018-09-10 10:21:31,188 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:30" (1/1) ... [2018-09-10 10:21:31,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:21:31,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:21:31,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:21:31,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:21:31,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:30" (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:31,280 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:31,280 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:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:21:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:21:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:21:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:21:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:21:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:21:34,715 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:21:34,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:34 BoogieIcfgContainer [2018-09-10 10:21:34,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:21:34,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:21:34,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:21:34,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:21:34,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:21:30" (1/3) ... [2018-09-10 10:21:34,726 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:34, skipping insertion in model container [2018-09-10 10:21:34,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:30" (2/3) ... [2018-09-10 10:21:34,727 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:34, skipping insertion in model container [2018-09-10 10:21:34,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:34" (3/3) ... [2018-09-10 10:21:34,730 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-09-10 10:21:34,740 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:21:34,751 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:21:34,817 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:21:34,818 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:21:34,819 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:21:34,819 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:21:34,819 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:21:34,819 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:21:34,820 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:21:34,820 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:21:34,820 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:21:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:21:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-10 10:21:34,865 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:34,867 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:34,868 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:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1030443373, now seen corresponding path program 1 times [2018-09-10 10:21:34,879 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:34,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:34,929 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:35,578 WARN L175 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:21:35,759 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:35,761 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:35,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:21:35,762 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:35,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:35,788 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:35,789 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:35,791 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:21:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:37,331 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-09-10 10:21:37,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:37,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-09-10 10:21:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:37,353 INFO L225 Difference]: With dead ends: 621 [2018-09-10 10:21:37,353 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:21:37,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:21:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-10 10:21:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-10 10:21:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-09-10 10:21:37,471 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-09-10 10:21:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:37,474 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-09-10 10:21:37,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-09-10 10:21:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-10 10:21:37,486 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:37,487 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:37,487 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:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 150931906, now seen corresponding path program 1 times [2018-09-10 10:21:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:37,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:37,492 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:38,072 WARN L175 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:21:38,329 WARN L175 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 10:21:38,454 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:38,454 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:38,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:38,455 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:38,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:38,458 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:38,458 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:38,458 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-09-10 10:21:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:40,015 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-09-10 10:21:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:40,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-09-10 10:21:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:40,022 INFO L225 Difference]: With dead ends: 903 [2018-09-10 10:21:40,023 INFO L226 Difference]: Without dead ends: 381 [2018-09-10 10:21:40,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-10 10:21:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-10 10:21:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-10 10:21:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-09-10 10:21:40,054 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-09-10 10:21:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:40,054 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-09-10 10:21:40,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-09-10 10:21:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-10 10:21:40,058 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:40,059 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:40,059 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:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1952730738, now seen corresponding path program 1 times [2018-09-10 10:21:40,059 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:40,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:40,061 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:40,520 WARN L175 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-09-10 10:21:40,707 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:40,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:40,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:40,708 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:40,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:40,709 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:40,709 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:40,710 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-09-10 10:21:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:42,304 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-09-10 10:21:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:42,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-09-10 10:21:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:42,309 INFO L225 Difference]: With dead ends: 901 [2018-09-10 10:21:42,309 INFO L226 Difference]: Without dead ends: 380 [2018-09-10 10:21:42,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-10 10:21:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-09-10 10:21:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-10 10:21:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-09-10 10:21:42,332 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-09-10 10:21:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:42,332 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-09-10 10:21:42,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-09-10 10:21:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-10 10:21:42,335 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:42,335 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:42,336 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:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash 204816549, now seen corresponding path program 1 times [2018-09-10 10:21:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:42,338 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:42,569 WARN L175 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:21:42,896 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:42,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:42,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:21:42,897 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:42,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:42,898 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:42,898 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:21:42,898 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-09-10 10:21:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:45,571 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-09-10 10:21:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:45,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-09-10 10:21:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:45,577 INFO L225 Difference]: With dead ends: 1193 [2018-09-10 10:21:45,577 INFO L226 Difference]: Without dead ends: 819 [2018-09-10 10:21:45,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:21:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-10 10:21:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-09-10 10:21:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-09-10 10:21:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-09-10 10:21:45,628 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-09-10 10:21:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:45,628 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-09-10 10:21:45,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-09-10 10:21:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-10 10:21:45,635 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:45,636 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:45,636 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:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash -556307991, now seen corresponding path program 1 times [2018-09-10 10:21:45,636 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:45,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:45,638 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:45,963 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:45,963 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:45,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:45,963 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:45,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:45,964 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:45,964 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:45,964 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-09-10 10:21:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:47,063 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-09-10 10:21:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:47,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-09-10 10:21:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:47,074 INFO L225 Difference]: With dead ends: 1753 [2018-09-10 10:21:47,074 INFO L226 Difference]: Without dead ends: 804 [2018-09-10 10:21:47,082 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:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-09-10 10:21:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-09-10 10:21:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-09-10 10:21:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-09-10 10:21:47,126 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-09-10 10:21:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:47,126 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-09-10 10:21:47,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-09-10 10:21:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-10 10:21:47,132 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:47,132 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:47,133 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:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash 442651437, now seen corresponding path program 1 times [2018-09-10 10:21:47,133 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:47,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:47,135 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:47,539 WARN L175 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-10 10:21:47,771 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 10:21:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:48,106 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:48,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:21:48,106 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:48,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:48,107 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:48,107 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:48,107 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-09-10 10:21:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:49,489 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-09-10 10:21:49,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:21:49,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-09-10 10:21:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:49,494 INFO L225 Difference]: With dead ends: 1747 [2018-09-10 10:21:49,494 INFO L226 Difference]: Without dead ends: 801 [2018-09-10 10:21:49,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:21:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-09-10 10:21:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-09-10 10:21:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-09-10 10:21:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-09-10 10:21:49,519 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-09-10 10:21:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:49,520 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-09-10 10:21:49,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-09-10 10:21:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-10 10:21:49,524 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:49,524 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:49,524 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:21:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2071094709, now seen corresponding path program 1 times [2018-09-10 10:21:49,525 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:49,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:49,526 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:49,696 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:21:49,697 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:49,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:21:49,697 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:49,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:49,701 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:49,701 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:21:49,701 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-09-10 10:21:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:50,924 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-09-10 10:21:50,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:50,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-09-10 10:21:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:50,938 INFO L225 Difference]: With dead ends: 2381 [2018-09-10 10:21:50,938 INFO L226 Difference]: Without dead ends: 1586 [2018-09-10 10:21:50,943 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:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-09-10 10:21:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-09-10 10:21:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-09-10 10:21:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-09-10 10:21:51,004 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-09-10 10:21:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:51,005 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-09-10 10:21:51,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-09-10 10:21:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-10 10:21:51,013 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:51,014 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:51,014 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:21:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1970113218, now seen corresponding path program 1 times [2018-09-10 10:21:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:51,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:51,016 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:51,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:51,265 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:51,274 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:51,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:21:51,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:21:51,934 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:21:51,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-09-10 10:21:51,935 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:51,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:51,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:51,936 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:21:51,936 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-09-10 10:21:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:54,284 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-09-10 10:21:54,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:54,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-09-10 10:21:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:54,312 INFO L225 Difference]: With dead ends: 4565 [2018-09-10 10:21:54,312 INFO L226 Difference]: Without dead ends: 3013 [2018-09-10 10:21:54,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:21:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-09-10 10:21:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-09-10 10:21:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-09-10 10:21:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-09-10 10:21:54,407 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 184 [2018-09-10 10:21:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:54,407 INFO L480 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-09-10 10:21:54,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-09-10 10:21:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-10 10:21:54,420 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:54,420 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, 1, 1, 1, 1, 1] [2018-09-10 10:21:54,420 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:21:54,421 INFO L82 PathProgramCache]: Analyzing trace with hash -194550555, now seen corresponding path program 1 times [2018-09-10 10:21:54,421 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:54,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:54,422 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:54,930 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:21:54,930 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:54,930 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:21:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:54,945 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:55,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:55,138 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:21:55,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:55,269 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:21:55,290 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:21:55,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:21:55,290 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:55,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:55,291 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:55,291 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:21:55,292 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 3 states. [2018-09-10 10:21:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:56,021 INFO L93 Difference]: Finished difference Result 6949 states and 9284 transitions. [2018-09-10 10:21:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:56,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-10 10:21:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:56,040 INFO L225 Difference]: With dead ends: 6949 [2018-09-10 10:21:56,040 INFO L226 Difference]: Without dead ends: 3947 [2018-09-10 10:21:56,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:21:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2018-09-10 10:21:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3942. [2018-09-10 10:21:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2018-09-10 10:21:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4805 transitions. [2018-09-10 10:21:56,134 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4805 transitions. Word has length 213 [2018-09-10 10:21:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:56,134 INFO L480 AbstractCegarLoop]: Abstraction has 3942 states and 4805 transitions. [2018-09-10 10:21:56,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4805 transitions. [2018-09-10 10:21:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-10 10:21:56,149 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:56,149 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:56,149 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:21:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1603900921, now seen corresponding path program 1 times [2018-09-10 10:21:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:56,151 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:56,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:56,645 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) [2018-09-10 10:21:56,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:56,658 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:56,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:56,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:57,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:57,088 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:21:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:57,105 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:57,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 74 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:57,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:57,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:21:57,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 8] total 12 [2018-09-10 10:21:57,770 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:21:57,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:57,772 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:57,772 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:21:57,772 INFO L87 Difference]: Start difference. First operand 3942 states and 4805 transitions. Second operand 6 states. [2018-09-10 10:21:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:59,096 INFO L93 Difference]: Finished difference Result 7851 states and 9707 transitions. [2018-09-10 10:21:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:59,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2018-09-10 10:21:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:59,120 INFO L225 Difference]: With dead ends: 7851 [2018-09-10 10:21:59,120 INFO L226 Difference]: Without dead ends: 3915 [2018-09-10 10:21:59,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 898 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:21:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-09-10 10:21:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3718. [2018-09-10 10:21:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2018-09-10 10:21:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 4310 transitions. [2018-09-10 10:21:59,233 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 4310 transitions. Word has length 228 [2018-09-10 10:21:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:59,233 INFO L480 AbstractCegarLoop]: Abstraction has 3718 states and 4310 transitions. [2018-09-10 10:21:59,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4310 transitions. [2018-09-10 10:21:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-10 10:21:59,247 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:59,247 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:21:59,248 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:21:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash 855047911, now seen corresponding path program 1 times [2018-09-10 10:21:59,248 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:59,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:59,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:59,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:59,249 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:59,845 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:59,845 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:59,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:59,853 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:59,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:00,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:00,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:00,265 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:22:00,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:00,281 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:00,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:00,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:01,010 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-10 10:22:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:22:01,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:22:01,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 5, 5] total 16 [2018-09-10 10:22:01,698 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:22:01,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 10:22:01,703 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 10:22:01,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:22:01,704 INFO L87 Difference]: Start difference. First operand 3718 states and 4310 transitions. Second operand 15 states. [2018-09-10 10:22:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:05,031 INFO L93 Difference]: Finished difference Result 8829 states and 10803 transitions. [2018-09-10 10:22:05,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-10 10:22:05,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-09-10 10:22:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:05,046 INFO L225 Difference]: With dead ends: 8829 [2018-09-10 10:22:05,046 INFO L226 Difference]: Without dead ends: 2879 [2018-09-10 10:22:05,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1023 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2018-09-10 10:22:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2018-09-10 10:22:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2687. [2018-09-10 10:22:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2018-09-10 10:22:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3126 transitions. [2018-09-10 10:22:05,159 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3126 transitions. Word has length 255 [2018-09-10 10:22:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:05,159 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 3126 transitions. [2018-09-10 10:22:05,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 10:22:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3126 transitions. [2018-09-10 10:22:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-09-10 10:22:05,176 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:05,177 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,177 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__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,177 INFO L82 PathProgramCache]: Analyzing trace with hash 91425834, now seen corresponding path program 1 times [2018-09-10 10:22:05,178 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:05,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:05,179 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:05,648 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:05,648 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:22:05,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:05,656 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:05,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-10 10:22:05,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:06,096 WARN L175 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-10 10:22:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-10 10:22:06,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:06,446 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 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:22:06,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:06,465 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:06,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 281 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:06,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 246 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:07,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:22:07,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 8, 8] total 20 [2018-09-10 10:22:07,500 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:22:07,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:22:07,501 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:22:07,501 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:22:07,502 INFO L87 Difference]: Start difference. First operand 2687 states and 3126 transitions. Second operand 13 states. [2018-09-10 10:22:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:12,191 INFO L93 Difference]: Finished difference Result 5552 states and 6595 transitions. [2018-09-10 10:22:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-10 10:22:12,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-09-10 10:22:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:12,197 INFO L225 Difference]: With dead ends: 5552 [2018-09-10 10:22:12,197 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:22:12,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1257 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2018-09-10 10:22:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:22:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:22:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:22:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:22:12,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2018-09-10 10:22:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:12,220 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:22:12,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:22:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:22:12,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:22:12,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:22:12,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,550 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 99 [2018-09-10 10:22:12,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:12,694 WARN L175 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 99 [2018-09-10 10:22:12,898 WARN L175 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-10 10:22:13,538 WARN L175 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-09-10 10:22:16,218 WARN L175 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 150 DAG size of output: 86 [2018-09-10 10:22:17,042 WARN L175 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2018-09-10 10:22:17,955 WARN L175 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2018-09-10 10:22:17,958 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,958 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,958 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,958 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:22:17,959 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,960 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:22:17,961 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:17,962 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:22:17,963 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:17,963 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:17,963 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:22:17,964 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:17,964 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:22:17,964 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:22:17,965 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:22:17,966 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:22:17,967 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:17,968 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,969 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:22:17,970 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:22:17,971 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:22:17,972 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:22:17,973 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:22:17,974 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:22:17,975 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,976 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:22:17,977 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:22:17,978 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,979 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:22:17,980 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:17,981 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:22:17,982 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 592) no Hoare annotation was computed. [2018-09-10 10:22:17,982 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:22:17,982 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:22:17,982 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,982 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,982 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,982 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,983 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:17,983 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:22:17,983 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:22:17,983 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:22:17,983 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:22:17,983 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:22:17,984 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 ((.cse10 (= |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)) (.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse28 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse11 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse3 (= |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)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) (let ((.cse19 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7))) (.cse20 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse17 (and .cse11 .cse6 .cse3 .cse4 .cse5)) (.cse15 (not .cse7)) (.cse16 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10))) (.cse25 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse21 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse22 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse23 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse9 (not .cse28)) (.cse24 (not .cse12)) (.cse27 (and .cse10 .cse3 .cse4 .cse6)) (.cse14 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7))) (.cse0 (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse8 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse13 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (.cse18 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse26 (and .cse11 .cse3 .cse4 .cse5 .cse6))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse7 (and .cse10 .cse11 .cse3 .cse4 .cse6) .cse12 .cse9 .cse13 .cse14) (or .cse2 .cse8 .cse15 .cse16 .cse17 .cse12 .cse18) (or .cse19 .cse2 .cse15 .cse9 (and .cse20 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse21 .cse22 .cse23) .cse14 .cse24) (or .cse2 (not .cse13) (and .cse25 .cse21 .cse22 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse23) .cse8 .cse15 .cse9 .cse24) (or .cse0 .cse26 .cse1 .cse2 .cse7 .cse12 .cse9 .cse13) (or .cse0 .cse1 .cse2 .cse27 .cse14 .cse18) (or .cse19 .cse2 .cse28 (and .cse25 .cse20 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not .cse23) .cse21) .cse7 .cse8 .cse24) (or .cse2 .cse17 .cse8 .cse15 .cse12 .cse9) (or .cse26 .cse1 .cse2 .cse8 .cse12 .cse9) (or .cse0 .cse1 .cse2 .cse7 .cse9 .cse13 .cse27 .cse14) (or .cse1 .cse2 .cse7 .cse11 .cse12 .cse14 .cse18) (or .cse0 .cse2 .cse7 .cse26 .cse8 .cse12 .cse13 .cse18) (or .cse0 .cse1 .cse2 .cse12 .cse11 .cse14 .cse18) (or .cse2 .cse8 .cse15 .cse16 (and .cse25 .cse21 .cse22 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse23) .cse9 .cse24) (or .cse1 .cse2 .cse7 .cse27 .cse14 .cse18) (or (or .cse0 .cse1 .cse2 .cse8 .cse12 .cse13 .cse18) .cse26)))) [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:22:17,985 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:17,986 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:22:17,986 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:17,986 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:17,986 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:22:17,986 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:22:17,986 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:17,986 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__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) [2018-09-10 10:22:17,987 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:17,987 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:17,987 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__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)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-09-10 10:22:17,987 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:22:17,987 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:17,988 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and (not (= ~__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)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) [2018-09-10 10:22:17,988 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:22:17,988 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse9 (= |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)) (.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse8 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse15 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse16 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse5 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse6 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse13 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse12 (not .cse17)) (.cse1 (= |old(~__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__a17~0)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (.cse3 (not (= ~__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__a28~0))) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (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 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse9 .cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) .cse10) (and .cse11 .cse12 .cse13 .cse0 .cse1 .cse14 .cse2) (and .cse11 .cse0 .cse1 .cse8 .cse15 .cse2) (and .cse16 .cse7 .cse8 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse12 .cse6 .cse13 .cse14 .cse2 .cse3 .cse4) (and .cse12 .cse6 .cse0 .cse9 .cse4 .cse10) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (and .cse11 .cse6 .cse14 .cse2 .cse3) (and .cse16 .cse7 .cse8 .cse15 .cse4) (and .cse11 .cse12 .cse6 .cse2 .cse3) (and .cse16 .cse5 .cse12 (not .cse4) .cse7) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse11 .cse13 .cse0 .cse1 .cse14 .cse2 .cse3) (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse0 .cse17 .cse1 .cse2 .cse4) (and .cse12 .cse6 .cse13 .cse0 .cse2 .cse3 .cse4) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse12 .cse1 .cse14 .cse2 .cse3 .cse4)))) [2018-09-10 10:22:17,988 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:17,988 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:17,989 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse9 (= |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)) (.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse8 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse15 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse16 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse5 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse6 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse13 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse12 (not .cse17)) (.cse1 (= |old(~__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__a17~0)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (.cse3 (not (= ~__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__a28~0))) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (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 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse9 .cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) .cse10) (and .cse11 .cse12 .cse13 .cse0 .cse1 .cse14 .cse2) (and .cse11 .cse0 .cse1 .cse8 .cse15 .cse2) (and .cse16 .cse7 .cse8 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse12 .cse6 .cse13 .cse14 .cse2 .cse3 .cse4) (and .cse12 .cse6 .cse0 .cse9 .cse4 .cse10) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (and .cse11 .cse6 .cse14 .cse2 .cse3) (and .cse16 .cse7 .cse8 .cse15 .cse4) (and .cse11 .cse12 .cse6 .cse2 .cse3) (and .cse16 .cse5 .cse12 (not .cse4) .cse7) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse11 .cse13 .cse0 .cse1 .cse14 .cse2 .cse3) (< 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse0 .cse17 .cse1 .cse2 .cse4) (and .cse12 .cse6 .cse13 .cse0 .cse2 .cse3 .cse4) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse12 .cse1 .cse14 .cse2 .cse3 .cse4)))) [2018-09-10 10:22:17,989 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:22:17,989 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:22:18,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:22:18 BoogieIcfgContainer [2018-09-10 10:22:18,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:22:18,022 INFO L168 Benchmark]: Toolchain (without parser) took 47844.02 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -279.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-10 10:22:18,023 INFO L168 Benchmark]: CDTParser took 0.23 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:18,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.20 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:18,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.73 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:18,025 INFO L168 Benchmark]: Boogie Preprocessor took 184.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:18,026 INFO L168 Benchmark]: RCFGBuilder took 3521.93 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: 118.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:18,027 INFO L168 Benchmark]: TraceAbstraction took 43303.87 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 609.7 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 409.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-10 10:22:18,032 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.23 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 747.20 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 79.73 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 184.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3521.93 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: 118.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43303.87 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 609.7 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 409.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: (((((((((((((((((((((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) || !(__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__a11 == 1) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && \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 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((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)) || ((((!(__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) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || ((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __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__a19 <= 0 && !(__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__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 8)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && __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 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17))) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == 1)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 9) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 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 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28))) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28))) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || ((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && !(__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__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 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 == __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__a28)) || ((((!(__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) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && !(__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__a17) == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 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) || (((((!(__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) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 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 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 43.1s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1642 SDtfs, 8422 SDslu, 1401 SDs, 0 SdLazy, 13042 SolverSat, 2163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4146 GetRequests, 3988 SyntacticMatches, 39 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3942occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 439 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 200 PreInvPairs, 352 NumberOfFragments, 1407 HoareAnnotationTreeSize, 200 FomulaSimplifications, 10534 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3398 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 4341 NumberOfCodeBlocks, 4341 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 6302 ConstructedInterpolants, 0 QuantifiedInterpolants, 5645532 SizeOfPredicates, 16 NumberOfNonLiveVariables, 4213 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 2951/3110 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_label06_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-22-18-055.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label06_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-22-18-055.csv Received shutdown request...