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_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:32:57,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:32:57,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:32:57,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:32:57,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:32:57,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:32:57,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:32:57,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:32:57,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:32:57,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:32:57,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:32:57,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:32:57,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:32:57,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:32:57,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:32:57,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:32:57,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:32:57,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:32:57,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:32:57,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:32:57,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:32:57,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:32:57,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:32:57,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:32:57,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:32:57,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:32:57,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:32:57,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:32:57,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:32:57,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:32:57,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:32:57,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:32:57,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:32:57,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:32:57,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:32:57,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:32:57,086 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:57,101 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:32:57,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:32:57,102 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:32:57,102 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:32:57,102 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:32:57,103 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:32:57,103 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:32:57,103 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:32:57,103 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:32:57,103 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:32:57,104 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:32:57,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:32:57,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:32:57,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:32:57,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:32:57,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:32:57,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:32:57,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:32:57,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:32:57,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:32:57,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:32:57,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:32:57,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:32:57,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:32:57,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:32:57,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:32:57,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:32:57,108 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:32:57,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:32:57,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:32:57,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:32:57,108 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:32:57,109 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:32:57,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:32:57,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:32:57,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:32:57,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:32:57,197 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:32:57,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label51_true-unreach-call.c [2018-09-10 11:32:57,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3062ce1/25d61c3594614e6d8bf1560564df09a2/FLAG4abf41ba0 [2018-09-10 11:32:57,797 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:32:57,798 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label51_true-unreach-call.c [2018-09-10 11:32:57,812 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3062ce1/25d61c3594614e6d8bf1560564df09a2/FLAG4abf41ba0 [2018-09-10 11:32:57,834 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3062ce1/25d61c3594614e6d8bf1560564df09a2 [2018-09-10 11:32:57,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:32:57,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:32:57,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:32:57,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:32:57,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:32:57,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:32:57" (1/1) ... [2018-09-10 11:32:57,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f47f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:57, skipping insertion in model container [2018-09-10 11:32:57,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:32:57" (1/1) ... [2018-09-10 11:32:58,068 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:32:58,331 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:32:58,350 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:32:58,530 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:32:58,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:58 WrapperNode [2018-09-10 11:32:58,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:32:58,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:32:58,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:32:58,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:32:58,608 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:58" (1/1) ... [2018-09-10 11:32:58,640 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:58" (1/1) ... [2018-09-10 11:32:58,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:32:58,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:32:58,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:32:58,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:32:58,737 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:58" (1/1) ... [2018-09-10 11:32:58,737 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:58" (1/1) ... [2018-09-10 11:32:58,753 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:58" (1/1) ... [2018-09-10 11:32:58,753 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:58" (1/1) ... [2018-09-10 11:32:58,778 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:58" (1/1) ... [2018-09-10 11:32:58,956 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:58" (1/1) ... [2018-09-10 11:32:58,975 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:58" (1/1) ... [2018-09-10 11:32:58,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:32:58,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:32:58,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:32:58,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:32:58,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:58" (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:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:32:59,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:32:59,067 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:59,068 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:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:32:59,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:32:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:32:59,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:33:02,475 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:33:02,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:33:02 BoogieIcfgContainer [2018-09-10 11:33:02,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:33:02,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:33:02,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:33:02,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:33:02,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:32:57" (1/3) ... [2018-09-10 11:33:02,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76de5005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:33:02, skipping insertion in model container [2018-09-10 11:33:02,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:32:58" (2/3) ... [2018-09-10 11:33:02,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76de5005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:33:02, skipping insertion in model container [2018-09-10 11:33:02,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:33:02" (3/3) ... [2018-09-10 11:33:02,485 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label51_true-unreach-call.c [2018-09-10 11:33:02,493 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:33:02,501 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:33:02,551 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:33:02,552 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:33:02,552 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:33:02,552 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:33:02,552 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:33:02,552 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:33:02,555 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:33:02,555 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:33:02,555 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:33:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-10 11:33:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-10 11:33:02,603 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:02,606 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] [2018-09-10 11:33:02,608 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:33:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash 748185177, now seen corresponding path program 1 times [2018-09-10 11:33:02,616 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:02,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:02,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:02,670 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:03,198 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:33:03,200 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:33:03,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:33:03,201 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:03,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:33:03,225 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:33:03,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:33:03,228 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-09-10 11:33:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:05,795 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-09-10 11:33:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:33:05,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-09-10 11:33:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:05,817 INFO L225 Difference]: With dead ends: 737 [2018-09-10 11:33:05,818 INFO L226 Difference]: Without dead ends: 515 [2018-09-10 11:33:05,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:33:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-10 11:33:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 356. [2018-09-10 11:33:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-10 11:33:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 613 transitions. [2018-09-10 11:33:05,906 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 613 transitions. Word has length 57 [2018-09-10 11:33:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:05,907 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 613 transitions. [2018-09-10 11:33:05,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:33:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 613 transitions. [2018-09-10 11:33:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-10 11:33:05,915 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:05,916 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, 1, 1, 1, 1, 1, 1, 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:33:05,916 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:33:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2000174539, now seen corresponding path program 1 times [2018-09-10 11:33:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:05,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:05,918 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:06,315 WARN L175 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:33:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 11:33:06,393 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:33:06,393 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:33:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:06,410 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:33:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:06,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:33:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:06,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:33:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:06,886 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 11:33:06,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-09-10 11:33:06,887 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:06,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:33:06,888 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:33:06,888 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:33:06,889 INFO L87 Difference]: Start difference. First operand 356 states and 613 transitions. Second operand 3 states. [2018-09-10 11:33:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:08,404 INFO L93 Difference]: Finished difference Result 994 states and 1780 transitions. [2018-09-10 11:33:08,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:33:08,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-09-10 11:33:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:08,421 INFO L225 Difference]: With dead ends: 994 [2018-09-10 11:33:08,421 INFO L226 Difference]: Without dead ends: 644 [2018-09-10 11:33:08,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 254 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:33:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-09-10 11:33:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2018-09-10 11:33:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-09-10 11:33:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1062 transitions. [2018-09-10 11:33:08,488 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1062 transitions. Word has length 128 [2018-09-10 11:33:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:08,489 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1062 transitions. [2018-09-10 11:33:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:33:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1062 transitions. [2018-09-10 11:33:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-10 11:33:08,496 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:08,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:08,497 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:33:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash -148058112, now seen corresponding path program 1 times [2018-09-10 11:33:08,497 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:08,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:08,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:08,499 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:08,863 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:33:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:09,001 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:33:09,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:33:09,001 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:09,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:33:09,003 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:33:09,003 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:33:09,003 INFO L87 Difference]: Start difference. First operand 644 states and 1062 transitions. Second operand 6 states. [2018-09-10 11:33:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:12,356 INFO L93 Difference]: Finished difference Result 1600 states and 2652 transitions. [2018-09-10 11:33:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:33:12,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-09-10 11:33:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:12,371 INFO L225 Difference]: With dead ends: 1600 [2018-09-10 11:33:12,371 INFO L226 Difference]: Without dead ends: 962 [2018-09-10 11:33:12,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:33:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-09-10 11:33:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 952. [2018-09-10 11:33:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-09-10 11:33:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1446 transitions. [2018-09-10 11:33:12,429 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1446 transitions. Word has length 183 [2018-09-10 11:33:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:12,430 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1446 transitions. [2018-09-10 11:33:12,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:33:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1446 transitions. [2018-09-10 11:33:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-10 11:33:12,439 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:12,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:12,440 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:33:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash -191509393, now seen corresponding path program 1 times [2018-09-10 11:33:12,440 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:12,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:12,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:12,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:12,442 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:12,837 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:33:12,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:33:12,838 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:12,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:33:12,839 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:33:12,839 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:33:12,839 INFO L87 Difference]: Start difference. First operand 952 states and 1446 transitions. Second operand 6 states. [2018-09-10 11:33:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:15,507 INFO L93 Difference]: Finished difference Result 2797 states and 4426 transitions. [2018-09-10 11:33:15,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:33:15,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-09-10 11:33:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:15,525 INFO L225 Difference]: With dead ends: 2797 [2018-09-10 11:33:15,525 INFO L226 Difference]: Without dead ends: 1851 [2018-09-10 11:33:15,530 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:33:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-09-10 11:33:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1827. [2018-09-10 11:33:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-09-10 11:33:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2655 transitions. [2018-09-10 11:33:15,610 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2655 transitions. Word has length 194 [2018-09-10 11:33:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:15,610 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2655 transitions. [2018-09-10 11:33:15,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:33:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2655 transitions. [2018-09-10 11:33:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-10 11:33:15,618 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:15,619 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:33:15,619 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:33:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1529936792, now seen corresponding path program 1 times [2018-09-10 11:33:15,619 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:15,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:15,621 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:15,902 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:33:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 100 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:33:16,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:33:16,359 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:33:16,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:16,378 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:33:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:16,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:33:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-10 11:33:16,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:33:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 100 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:33:17,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:33:17,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 11:33:17,014 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:17,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:33:17,016 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:33:17,016 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 11:33:17,016 INFO L87 Difference]: Start difference. First operand 1827 states and 2655 transitions. Second operand 5 states. [2018-09-10 11:33:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:20,252 INFO L93 Difference]: Finished difference Result 4886 states and 7343 transitions. [2018-09-10 11:33:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:33:20,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-09-10 11:33:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:20,271 INFO L225 Difference]: With dead ends: 4886 [2018-09-10 11:33:20,271 INFO L226 Difference]: Without dead ends: 3065 [2018-09-10 11:33:20,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 523 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-10 11:33:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2018-09-10 11:33:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3037. [2018-09-10 11:33:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3037 states. [2018-09-10 11:33:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4164 transitions. [2018-09-10 11:33:20,377 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4164 transitions. Word has length 264 [2018-09-10 11:33:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:20,378 INFO L480 AbstractCegarLoop]: Abstraction has 3037 states and 4164 transitions. [2018-09-10 11:33:20,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:33:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4164 transitions. [2018-09-10 11:33:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-10 11:33:20,389 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:20,390 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, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:33:20,390 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:33:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 266821668, now seen corresponding path program 1 times [2018-09-10 11:33:20,391 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:20,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:20,392 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-09-10 11:33:20,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:33:20,775 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:33:20,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:20,784 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:33:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:20,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:33:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:21,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:33:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:21,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:33:21,602 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:33:21,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:21,638 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:33:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:21,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:33:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:22,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:33:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:22,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:33:22,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 13 [2018-09-10 11:33:22,494 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:33:22,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-10 11:33:22,496 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-10 11:33:22,496 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-09-10 11:33:22,496 INFO L87 Difference]: Start difference. First operand 3037 states and 4164 transitions. Second operand 11 states. [2018-09-10 11:33:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:25,654 INFO L93 Difference]: Finished difference Result 7885 states and 10993 transitions. [2018-09-10 11:33:25,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-10 11:33:25,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2018-09-10 11:33:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:25,666 INFO L225 Difference]: With dead ends: 7885 [2018-09-10 11:33:25,666 INFO L226 Difference]: Without dead ends: 2334 [2018-09-10 11:33:25,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1095 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2018-09-10 11:33:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-09-10 11:33:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 1773. [2018-09-10 11:33:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2018-09-10 11:33:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2105 transitions. [2018-09-10 11:33:25,744 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2105 transitions. Word has length 274 [2018-09-10 11:33:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:25,745 INFO L480 AbstractCegarLoop]: Abstraction has 1773 states and 2105 transitions. [2018-09-10 11:33:25,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-10 11:33:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2105 transitions. [2018-09-10 11:33:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-10 11:33:25,752 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:25,753 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:33:25,753 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:33:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash -62782948, now seen corresponding path program 1 times [2018-09-10 11:33:25,753 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:25,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:25,755 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-09-10 11:33:26,069 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:33:26,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:33:26,070 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:26,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:33:26,070 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:33:26,071 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:33:26,071 INFO L87 Difference]: Start difference. First operand 1773 states and 2105 transitions. Second operand 4 states. [2018-09-10 11:33:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:33:28,037 INFO L93 Difference]: Finished difference Result 4268 states and 5201 transitions. [2018-09-10 11:33:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:33:28,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2018-09-10 11:33:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:33:28,039 INFO L225 Difference]: With dead ends: 4268 [2018-09-10 11:33:28,039 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 11:33:28,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:33:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 11:33:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 11:33:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 11:33:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 11:33:28,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2018-09-10 11:33:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:33:28,047 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 11:33:28,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:33:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 11:33:28,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 11:33:28,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 11:33:28,546 WARN L175 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-09-10 11:33:29,175 WARN L175 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2018-09-10 11:33:29,359 WARN L175 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-09-10 11:33:30,049 WARN L175 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 41 [2018-09-10 11:33:30,389 WARN L175 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2018-09-10 11:33:30,820 WARN L175 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2018-09-10 11:33:30,822 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:33:30,823 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)) [2018-09-10 11:33:30,823 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:33:30,823 INFO L426 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-09-10 11:33:30,823 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,823 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 11:33:30,824 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,825 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 11:33:30,826 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,827 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,827 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:33:30,827 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 11:33:30,828 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:33:30,828 INFO L426 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-09-10 11:33:30,828 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-09-10 11:33:30,829 INFO L426 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-09-10 11:33:30,830 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,831 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-09-10 11:33:30,832 INFO L426 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-09-10 11:33:30,833 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 11:33:30,834 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 154) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,834 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-09-10 11:33:30,835 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,836 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-09-10 11:33:30,837 INFO L426 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 11:33:30,838 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,839 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-09-10 11:33:30,840 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 11:33:30,841 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 11:33:30,842 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 11:33:30,842 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 11:33:30,842 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 11:33:30,842 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 (= |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)) (.cse8 (= |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))) (let ((.cse2 (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse0 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (.cse3 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 13) 0)) (.cse5 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13))) (.cse6 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse1 (and .cse7 .cse8)) (.cse4 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)))) (and (or .cse0 .cse1 .cse2) (or .cse1 .cse2 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9)) (or .cse3 .cse4 .cse5) (or .cse2 (or (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse3) .cse5) (or .cse0 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse1 .cse6) (or .cse3 (and .cse7 .cse5 .cse8) .cse6) (or .cse1 .cse4)))) [2018-09-10 11:33:30,842 INFO L426 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-09-10 11:33:30,842 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-09-10 11:33:30,843 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-09-10 11:33:30,843 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:33:30,843 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0) (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0) (<= 23 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) [2018-09-10 11:33:30,843 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 11:33:30,843 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:33:30,843 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~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)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) [2018-09-10 11:33:30,843 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:33:30,844 INFO L422 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1))) (.cse5 (not (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0))) (.cse4 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13))) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (.cse3 (= |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)) (.cse0 (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (or (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) .cse1 .cse2) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and .cse3 (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0) .cse4)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse0 .cse5 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) (and .cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) .cse5) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (and .cse0 .cse4 .cse2) (and .cse3 .cse0))) [2018-09-10 11:33:30,844 INFO L426 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-09-10 11:33:30,844 INFO L426 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-09-10 11:33:30,844 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-09-10 11:33:30,844 INFO L422 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 1))) (.cse5 (not (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0))) (.cse4 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 13))) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) (.cse3 (= |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)) (.cse0 (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (or (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 8)) .cse1 .cse2) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and .cse3 (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0) .cse4)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and .cse0 .cse5 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)) (and .cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)| 9) .cse5) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 23) (and .cse0 .cse4 .cse2) (and .cse3 .cse0))) [2018-09-10 11:33:30,845 INFO L426 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:33:30,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:33:30 BoogieIcfgContainer [2018-09-10 11:33:30,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:33:30,869 INFO L168 Benchmark]: Toolchain (without parser) took 33020.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -263.9 MB). Peak memory consumption was 868.0 MB. Max. memory is 7.1 GB. [2018-09-10 11:33:30,870 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 11:33:30,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:33:30,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.82 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:33:30,873 INFO L168 Benchmark]: Boogie Preprocessor took 264.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -900.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2018-09-10 11:33:30,874 INFO L168 Benchmark]: RCFGBuilder took 3488.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 121.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 7.1 GB. [2018-09-10 11:33:30,875 INFO L168 Benchmark]: TraceAbstraction took 28390.65 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 337.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 473.1 MB). Peak memory consumption was 810.2 MB. Max. memory is 7.1 GB. [2018-09-10 11:33:30,880 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.82 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 264.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -900.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3488.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 121.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28390.65 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 337.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 473.1 MB). Peak memory consumption was 810.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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: ((((((((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) < 9 || (((9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 8)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8)) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 <= 0 && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 13)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || ((9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && !(3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || ((!(__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__a19) == 9) && !(3 == __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) || ((9 == \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__a1 + 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 <= 8)) || (\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 && 9 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 28.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 18.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 641 SDtfs, 4946 SDslu, 668 SDs, 0 SdLazy, 7493 SolverSat, 1603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1957 GetRequests, 1883 SyntacticMatches, 17 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3037occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 782 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 85 PreInvPairs, 143 NumberOfFragments, 338 HoareAnnotationTreeSize, 85 FomulaSimplifications, 2473 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2943 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2350 NumberOfCodeBlocks, 2350 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3275 ConstructedInterpolants, 0 QuantifiedInterpolants, 2313096 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1603 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1686/1876 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_label51_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-33-30-899.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label51_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-33-30-899.csv Received shutdown request...