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/Problem10_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:32:08,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:32:08,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:32:08,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:32:08,678 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:32:08,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:32:08,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:32:08,685 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:32:08,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:32:08,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:32:08,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:32:08,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:32:08,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:32:08,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:32:08,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:32:08,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:32:08,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:32:08,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:32:08,714 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:32:08,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:32:08,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:32:08,723 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:32:08,730 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:32:08,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:32:08,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:32:08,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:32:08,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:32:08,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:32:08,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:32:08,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:32:08,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:32:08,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:32:08,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:32:08,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:32:08,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:32:08,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:32:08,749 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 11:32:08,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:32:08,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:32:08,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:32:08,782 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:32:08,782 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:32:08,783 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:32:08,783 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:32:08,784 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:32:08,784 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:32:08,784 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:32:08,784 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:32:08,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:32:08,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:32:08,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:32:08,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:32:08,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:32:08,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:32:08,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:32:08,789 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:32:08,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:32:08,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:32:08,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:32:08,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:32:08,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:32:08,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:32:08,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:32:08,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:32:08,792 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:32:08,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:32:08,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:32:08,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:32:08,793 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:32:08,793 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:32:08,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:32:08,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:32:08,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:32:08,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:32:08,904 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:32:08,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c [2018-09-10 11:32:09,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8b060ac/a0392f70b00b476284b8fe853c0d89f3/FLAG14ae13f31 [2018-09-10 11:32:09,631 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:32:09,634 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c [2018-09-10 11:32:09,655 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8b060ac/a0392f70b00b476284b8fe853c0d89f3/FLAG14ae13f31 [2018-09-10 11:32:09,676 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8b060ac/a0392f70b00b476284b8fe853c0d89f3 [2018-09-10 11:32:09,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:32:09,693 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:32:09,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:32:09,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:32:09,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:32:09,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:32:09" (1/1) ... [2018-09-10 11:32:09,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad3ee8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:09, skipping insertion in model container [2018-09-10 11:32:09,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:32:09" (1/1) ... [2018-09-10 11:32:09,927 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:32:10,196 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:32:10,222 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:32:10,506 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:32:10,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10 WrapperNode [2018-09-10 11:32:10,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:32:10,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:32:10,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:32:10,598 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:32:10,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:10,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:10,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:32:10,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:32:10,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:32:10,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:32:10,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:10,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:10,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:10,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:11,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:11,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:11,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (1/1) ... [2018-09-10 11:32:11,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:32:11,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:32:11,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:32:11,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:32:11,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (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 11:32:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:32:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:32:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:32:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:32:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:32:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:32:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:32:11,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:32:14,689 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:32:14,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:32:14 BoogieIcfgContainer [2018-09-10 11:32:14,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:32:14,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:32:14,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:32:14,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:32:14,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:32:09" (1/3) ... [2018-09-10 11:32:14,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d54de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:32:14, skipping insertion in model container [2018-09-10 11:32:14,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:10" (2/3) ... [2018-09-10 11:32:14,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d54de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:32:14, skipping insertion in model container [2018-09-10 11:32:14,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:32:14" (3/3) ... [2018-09-10 11:32:14,702 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label27_true-unreach-call.c [2018-09-10 11:32:14,713 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:32:14,727 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:32:14,780 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:32:14,781 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:32:14,781 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:32:14,781 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:32:14,781 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:32:14,782 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:32:14,782 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:32:14,782 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:32:14,782 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:32:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-10 11:32:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-10 11:32:14,819 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:14,820 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] [2018-09-10 11:32:14,822 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 51771233, now seen corresponding path program 1 times [2018-09-10 11:32:14,831 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:14,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:14,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:14,882 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:15,411 WARN L175 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:15,602 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 11:32:15,605 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:15,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:32:15,609 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:15,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:32:15,640 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:32:15,641 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:32:15,643 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-09-10 11:32:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:17,718 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-09-10 11:32:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:32:17,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-09-10 11:32:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:17,742 INFO L225 Difference]: With dead ends: 574 [2018-09-10 11:32:17,742 INFO L226 Difference]: Without dead ends: 356 [2018-09-10 11:32:17,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:32:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-10 11:32:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-09-10 11:32:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-10 11:32:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-09-10 11:32:17,835 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 67 [2018-09-10 11:32:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:17,836 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-09-10 11:32:17,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:32:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-09-10 11:32:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-10 11:32:17,846 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:17,847 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:32:17,847 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash -29131829, now seen corresponding path program 1 times [2018-09-10 11:32:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:17,850 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:18,201 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:18,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:18,201 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:18,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:18,204 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:18,204 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:18,205 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-09-10 11:32:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:20,858 INFO L93 Difference]: Finished difference Result 998 states and 1753 transitions. [2018-09-10 11:32:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:20,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2018-09-10 11:32:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:20,867 INFO L225 Difference]: With dead ends: 998 [2018-09-10 11:32:20,867 INFO L226 Difference]: Without dead ends: 648 [2018-09-10 11:32:20,873 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 11:32:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-09-10 11:32:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 639. [2018-09-10 11:32:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-09-10 11:32:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 994 transitions. [2018-09-10 11:32:20,923 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 994 transitions. Word has length 150 [2018-09-10 11:32:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:20,924 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 994 transitions. [2018-09-10 11:32:20,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 994 transitions. [2018-09-10 11:32:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-10 11:32:20,931 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:20,931 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:32:20,932 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash -848624405, now seen corresponding path program 1 times [2018-09-10 11:32:20,932 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:20,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:20,934 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:21,247 WARN L175 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:21,421 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:21,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:21,421 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:21,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:21,422 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:21,422 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:21,423 INFO L87 Difference]: Start difference. First operand 639 states and 994 transitions. Second operand 6 states. [2018-09-10 11:32:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:25,260 INFO L93 Difference]: Finished difference Result 1567 states and 2516 transitions. [2018-09-10 11:32:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:25,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-09-10 11:32:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:25,274 INFO L225 Difference]: With dead ends: 1567 [2018-09-10 11:32:25,274 INFO L226 Difference]: Without dead ends: 934 [2018-09-10 11:32:25,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:32:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-09-10 11:32:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 918. [2018-09-10 11:32:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-09-10 11:32:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1356 transitions. [2018-09-10 11:32:25,343 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1356 transitions. Word has length 166 [2018-09-10 11:32:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:25,346 INFO L480 AbstractCegarLoop]: Abstraction has 918 states and 1356 transitions. [2018-09-10 11:32:25,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1356 transitions. [2018-09-10 11:32:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-10 11:32:25,351 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:25,353 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:25,353 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:25,353 INFO L82 PathProgramCache]: Analyzing trace with hash 453395831, now seen corresponding path program 1 times [2018-09-10 11:32:25,354 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:25,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:25,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:25,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:25,355 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:25,732 WARN L175 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:26,123 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:26,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:26,124 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:26,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:26,125 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:26,125 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:26,125 INFO L87 Difference]: Start difference. First operand 918 states and 1356 transitions. Second operand 6 states. [2018-09-10 11:32:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:29,498 INFO L93 Difference]: Finished difference Result 2394 states and 3682 transitions. [2018-09-10 11:32:29,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:29,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 188 [2018-09-10 11:32:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:29,523 INFO L225 Difference]: With dead ends: 2394 [2018-09-10 11:32:29,523 INFO L226 Difference]: Without dead ends: 1482 [2018-09-10 11:32:29,528 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 11:32:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-10 11:32:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1460. [2018-09-10 11:32:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2018-09-10 11:32:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2048 transitions. [2018-09-10 11:32:29,583 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2048 transitions. Word has length 188 [2018-09-10 11:32:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:29,583 INFO L480 AbstractCegarLoop]: Abstraction has 1460 states and 2048 transitions. [2018-09-10 11:32:29,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2048 transitions. [2018-09-10 11:32:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-10 11:32:29,589 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:29,590 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:29,590 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash -67104101, now seen corresponding path program 1 times [2018-09-10 11:32:29,590 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:29,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:29,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:29,592 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:29,878 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:32:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:32:30,304 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:30,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:32:30,304 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:30,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:32:30,305 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:32:30,306 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:32:30,306 INFO L87 Difference]: Start difference. First operand 1460 states and 2048 transitions. Second operand 6 states. [2018-09-10 11:32:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:32,161 INFO L93 Difference]: Finished difference Result 3258 states and 4710 transitions. [2018-09-10 11:32:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:32,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-09-10 11:32:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:32,177 INFO L225 Difference]: With dead ends: 3258 [2018-09-10 11:32:32,178 INFO L226 Difference]: Without dead ends: 1804 [2018-09-10 11:32:32,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:32:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-09-10 11:32:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1766. [2018-09-10 11:32:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-09-10 11:32:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2376 transitions. [2018-09-10 11:32:32,260 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2376 transitions. Word has length 190 [2018-09-10 11:32:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:32,261 INFO L480 AbstractCegarLoop]: Abstraction has 1766 states and 2376 transitions. [2018-09-10 11:32:32,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:32:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2376 transitions. [2018-09-10 11:32:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-10 11:32:32,269 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:32,270 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:32,270 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1369063408, now seen corresponding path program 1 times [2018-09-10 11:32:32,271 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:32,272 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-09-10 11:32:32,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:32,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:32:32,526 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:32,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:32:32,527 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:32:32,527 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:32:32,527 INFO L87 Difference]: Start difference. First operand 1766 states and 2376 transitions. Second operand 4 states. [2018-09-10 11:32:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:33,919 INFO L93 Difference]: Finished difference Result 3820 states and 5188 transitions. [2018-09-10 11:32:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:32:33,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-09-10 11:32:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:33,929 INFO L225 Difference]: With dead ends: 3820 [2018-09-10 11:32:33,929 INFO L226 Difference]: Without dead ends: 2060 [2018-09-10 11:32:33,937 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:32:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2018-09-10 11:32:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2029. [2018-09-10 11:32:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-09-10 11:32:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2544 transitions. [2018-09-10 11:32:33,986 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2544 transitions. Word has length 238 [2018-09-10 11:32:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:33,987 INFO L480 AbstractCegarLoop]: Abstraction has 2029 states and 2544 transitions. [2018-09-10 11:32:33,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:32:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2544 transitions. [2018-09-10 11:32:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-10 11:32:33,995 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:33,995 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:32:33,995 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1628219228, now seen corresponding path program 1 times [2018-09-10 11:32:33,996 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:33,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:33,997 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 73 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:32:34,241 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:34,241 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 11:32:34,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:34,254 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:34,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-10 11:32:34,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:35,220 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 11:32:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 73 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:32:35,464 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:32:35,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2018-09-10 11:32:35,464 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:35,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:32:35,466 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:32:35,466 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 11:32:35,466 INFO L87 Difference]: Start difference. First operand 2029 states and 2544 transitions. Second operand 5 states. [2018-09-10 11:32:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:37,912 INFO L93 Difference]: Finished difference Result 5213 states and 6603 transitions. [2018-09-10 11:32:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:32:37,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2018-09-10 11:32:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:37,930 INFO L225 Difference]: With dead ends: 5213 [2018-09-10 11:32:37,930 INFO L226 Difference]: Without dead ends: 3190 [2018-09-10 11:32:37,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 485 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-10 11:32:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2018-09-10 11:32:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3092. [2018-09-10 11:32:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2018-09-10 11:32:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 3780 transitions. [2018-09-10 11:32:38,013 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 3780 transitions. Word has length 244 [2018-09-10 11:32:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:38,014 INFO L480 AbstractCegarLoop]: Abstraction has 3092 states and 3780 transitions. [2018-09-10 11:32:38,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:32:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3780 transitions. [2018-09-10 11:32:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-10 11:32:38,028 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:38,028 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-09-10 11:32:38,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1924060846, now seen corresponding path program 1 times [2018-09-10 11:32:38,029 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:38,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:38,030 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:39,521 WARN L175 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-10 11:32:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 195 proven. 141 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-10 11:32:39,991 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:39,991 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 11:32:39,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:39,999 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:40,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 337 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-10 11:32:40,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:40,506 WARN L175 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 11:32:40,629 WARN L175 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 11:32:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 254 proven. 77 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:32:40,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:40,972 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:32:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:40,987 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:41,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 337 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-10 11:32:41,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:41,562 WARN L175 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 11:32:41,739 WARN L175 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 11:32:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 254 proven. 77 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:32:41,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:32:41,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5, 5, 5] total 22 [2018-09-10 11:32:41,966 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:32:41,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-10 11:32:41,967 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-10 11:32:41,968 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-09-10 11:32:41,968 INFO L87 Difference]: Start difference. First operand 3092 states and 3780 transitions. Second operand 17 states. [2018-09-10 11:32:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:48,098 INFO L93 Difference]: Finished difference Result 6095 states and 7518 transitions. [2018-09-10 11:32:48,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-10 11:32:48,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 315 [2018-09-10 11:32:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:48,099 INFO L225 Difference]: With dead ends: 6095 [2018-09-10 11:32:48,099 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 11:32:48,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1264 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2018-09-10 11:32:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 11:32:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 11:32:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 11:32:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 11:32:48,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 315 [2018-09-10 11:32:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:48,118 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 11:32:48,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-10 11:32:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 11:32:48,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 11:32:48,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 11:32:48,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:48,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:49,141 WARN L175 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 47 [2018-09-10 11:32:49,455 WARN L175 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-09-10 11:32:49,837 WARN L175 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-09-10 11:32:49,840 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:32:49,840 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|)) [2018-09-10 11:32:49,840 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:32:49,840 INFO L426 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-09-10 11:32:49,840 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 11:32:49,841 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-09-10 11:32:49,842 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-09-10 11:32:49,843 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-09-10 11:32:49,844 INFO L426 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 11:32:49,845 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,846 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 11:32:49,847 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,848 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-09-10 11:32:49,849 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 11:32:49,850 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,851 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-09-10 11:32:49,852 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 11:32:49,853 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,854 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-09-10 11:32:49,855 INFO L426 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,856 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 11:32:49,857 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:49,858 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 11:32:49,859 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 11:32:49,860 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|)) (.cse4 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (let ((.cse5 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 13) 0)) (.cse6 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) (.cse1 (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse8 (not .cse4)) (.cse0 (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (.cse3 (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0))) (.cse2 (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (or (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) .cse0 .cse5 (and .cse6 .cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) .cse3 .cse8) (or .cse0 .cse5 (and .cse6 .cse7 (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) .cse3 (not .cse1) .cse8) (or .cse0 .cse3 .cse2 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse4)))) [2018-09-10 11:32:49,860 INFO L426 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-09-10 11:32:49,860 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-09-10 11:32:49,860 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-09-10 11:32:49,860 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:32:49,860 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 14) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3)) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23) (not (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0))) [2018-09-10 11:32:49,861 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 11:32:49,861 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:32:49,861 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23))) [2018-09-10 11:32:49,861 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:32:49,861 INFO L422 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse5 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|))) (let ((.cse0 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13))) (.cse1 (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7))) (.cse2 (or .cse5 (= 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|))) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10)))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) .cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23)) .cse5 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (and .cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse2) (and .cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3)) .cse2 (not .cse1)) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse4 .cse2 .cse3)))) [2018-09-10 11:32:49,861 INFO L426 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-09-10 11:32:49,862 INFO L426 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-09-10 11:32:49,862 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-09-10 11:32:49,862 INFO L422 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse5 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|))) (let ((.cse0 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13))) (.cse1 (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (.cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 7))) (.cse2 (or .cse5 (= 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|))) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10)))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (< 23 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) .cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 23)) .cse5 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (and .cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse2) (and .cse4 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 4)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 3)) .cse2 (not .cse1)) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse4 .cse2 .cse3)))) [2018-09-10 11:32:49,862 INFO L426 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:32:49,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:32:49 BoogieIcfgContainer [2018-09-10 11:32:49,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:32:49,887 INFO L168 Benchmark]: Toolchain (without parser) took 40197.35 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -472.4 MB). Peak memory consumption was 696.8 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:49,889 INFO L168 Benchmark]: CDTParser took 0.35 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 11:32:49,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.55 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 11:32:49,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:49,891 INFO L168 Benchmark]: Boogie Preprocessor took 342.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -869.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:49,892 INFO L168 Benchmark]: RCFGBuilder took 3609.73 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: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:49,892 INFO L168 Benchmark]: TraceAbstraction took 35195.12 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 394.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 233.7 MB). Peak memory consumption was 628.0 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:49,898 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.35 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 901.55 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 141.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 342.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -869.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3609.73 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: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35195.12 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 394.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 233.7 MB). Peak memory consumption was 628.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((((((!(0 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) || 2 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || 23 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) || 3 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || (((0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13 && 2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) && (1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) || 0 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10))) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 7) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) && 23 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 <= 23)) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) < 23) || ((0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) && (1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) || 0 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)))) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 4)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 3)) && (1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) || 0 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) && !(2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) || !(14 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4)) || 4 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 7) && (1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) || 0 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 35.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 23.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 672 SDtfs, 7018 SDslu, 986 SDs, 0 SdLazy, 10987 SolverSat, 1855 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1851 GetRequests, 1762 SyntacticMatches, 13 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3092occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 214 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 64 PreInvPairs, 92 NumberOfFragments, 477 HoareAnnotationTreeSize, 64 FomulaSimplifications, 3934 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1174 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2432 NumberOfCodeBlocks, 2432 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3292 ConstructedInterpolants, 0 QuantifiedInterpolants, 3377057 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1467 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 2592/3037 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/Problem10_label27_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-32-49-939.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label27_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-32-49-939.csv Received shutdown request...