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/Problem16_label47_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:20:48,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:20:48,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:20:48,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:20:48,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:20:48,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:20:48,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:20:48,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:20:48,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:20:48,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:20:48,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:20:48,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:20:48,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:20:48,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:20:48,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:20:48,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:20:48,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:20:48,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:20:48,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:20:48,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:20:48,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:20:48,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:20:48,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:20:48,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:20:48,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:20:48,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:20:48,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:20:48,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:20:48,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:20:48,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:20:48,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:20:48,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:20:48,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:20:48,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:20:48,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:20:48,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:20:48,344 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 12:20:48,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:20:48,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:20:48,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:20:48,365 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:20:48,365 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:20:48,365 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:20:48,365 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:20:48,365 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:20:48,366 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:20:48,366 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:20:48,366 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:20:48,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:20:48,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:20:48,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:20:48,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:20:48,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:20:48,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:20:48,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:20:48,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:20:48,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:20:48,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:20:48,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:20:48,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:20:48,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:20:48,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:20:48,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:20:48,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:20:48,370 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:20:48,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:20:48,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:20:48,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:20:48,371 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:20:48,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:20:48,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:20:48,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:20:48,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:20:48,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:20:48,442 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:20:48,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label47_true-unreach-call.c [2018-09-10 12:20:48,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1039b35fe/0395b326ee0b48e9a04c105556839407/FLAGcdc89ae6d [2018-09-10 12:20:49,205 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:20:49,206 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label47_true-unreach-call.c [2018-09-10 12:20:49,229 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1039b35fe/0395b326ee0b48e9a04c105556839407/FLAGcdc89ae6d [2018-09-10 12:20:49,244 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1039b35fe/0395b326ee0b48e9a04c105556839407 [2018-09-10 12:20:49,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:20:49,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:20:49,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:20:49,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:20:49,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:20:49,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:20:49" (1/1) ... [2018-09-10 12:20:49,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d96ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:49, skipping insertion in model container [2018-09-10 12:20:49,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:20:49" (1/1) ... [2018-09-10 12:20:49,504 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:20:50,051 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:20:50,077 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:20:50,339 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:20:50,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50 WrapperNode [2018-09-10 12:20:50,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:20:50,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:20:50,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:20:50,456 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:20:50,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:50,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:50,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:20:50,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:20:50,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:20:50,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:20:50,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:50,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:51,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:51,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:51,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:51,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:51,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (1/1) ... [2018-09-10 12:20:51,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:20:51,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:20:51,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:20:51,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:20:51,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (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 12:20:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:20:51,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:20:51,188 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 12:20:51,188 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 12:20:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:20:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:20:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:20:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:20:51,189 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_output2 [2018-09-10 12:20:51,189 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_output2 [2018-09-10 12:20:57,938 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:20:57,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:20:57 BoogieIcfgContainer [2018-09-10 12:20:57,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:20:57,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:20:57,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:20:57,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:20:57,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:20:49" (1/3) ... [2018-09-10 12:20:57,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4274941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:20:57, skipping insertion in model container [2018-09-10 12:20:57,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:20:50" (2/3) ... [2018-09-10 12:20:57,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4274941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:20:57, skipping insertion in model container [2018-09-10 12:20:57,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:20:57" (3/3) ... [2018-09-10 12:20:57,948 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label47_true-unreach-call.c [2018-09-10 12:20:57,958 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:20:57,967 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:20:58,024 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:20:58,024 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:20:58,025 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:20:58,025 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:20:58,025 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:20:58,025 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:20:58,025 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:20:58,025 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:20:58,025 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:20:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-10 12:20:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-10 12:20:58,069 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:20:58,070 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:20:58,071 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 12:20:58,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1900334580, now seen corresponding path program 1 times [2018-09-10 12:20:58,079 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:20:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:20:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:20:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:20:58,132 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:20:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:20:58,650 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-09-10 12:20:58,742 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 12:20:58,745 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:20:58,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:20:58,746 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:20:58,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:20:58,768 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:20:58,768 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:20:58,771 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-09-10 12:21:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:07,176 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-09-10 12:21:07,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:21:07,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-09-10 12:21:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:07,211 INFO L225 Difference]: With dead ends: 1513 [2018-09-10 12:21:07,211 INFO L226 Difference]: Without dead ends: 1097 [2018-09-10 12:21:07,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:21:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-09-10 12:21:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-09-10 12:21:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-10 12:21:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-09-10 12:21:07,425 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 72 [2018-09-10 12:21:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:07,426 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-09-10 12:21:07,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:21:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-09-10 12:21:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-10 12:21:07,444 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:07,445 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:21:07,445 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 12:21:07,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1969205670, now seen corresponding path program 1 times [2018-09-10 12:21:07,454 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:07,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:07,455 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:07,786 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:21:07,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 12:21:07,786 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:21:07,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:21:07,788 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:21:07,789 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 12:21:07,789 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-09-10 12:21:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:12,617 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-09-10 12:21:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:21:12,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-09-10 12:21:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:12,635 INFO L225 Difference]: With dead ends: 2196 [2018-09-10 12:21:12,636 INFO L226 Difference]: Without dead ends: 1458 [2018-09-10 12:21:12,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 12:21:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-09-10 12:21:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-09-10 12:21:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-09-10 12:21:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-09-10 12:21:12,723 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 142 [2018-09-10 12:21:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:12,724 INFO L480 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-09-10 12:21:12,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:21:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-09-10 12:21:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-10 12:21:12,731 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:12,731 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:21:12,733 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 12:21:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1969343363, now seen corresponding path program 1 times [2018-09-10 12:21:12,733 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:12,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:12,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:12,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:12,735 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:12,978 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:21:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:13,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:21:13,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:21:13,035 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:21:13,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:21:13,036 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:21:13,036 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:21:13,037 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-09-10 12:21:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:19,269 INFO L93 Difference]: Finished difference Result 3595 states and 6402 transitions. [2018-09-10 12:21:19,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:21:19,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-09-10 12:21:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:19,285 INFO L225 Difference]: With dead ends: 3595 [2018-09-10 12:21:19,285 INFO L226 Difference]: Without dead ends: 2163 [2018-09-10 12:21:19,292 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 12:21:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2018-09-10 12:21:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2143. [2018-09-10 12:21:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2018-09-10 12:21:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3219 transitions. [2018-09-10 12:21:19,369 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3219 transitions. Word has length 145 [2018-09-10 12:21:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:19,369 INFO L480 AbstractCegarLoop]: Abstraction has 2143 states and 3219 transitions. [2018-09-10 12:21:19,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:21:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3219 transitions. [2018-09-10 12:21:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-10 12:21:19,372 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:19,373 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:21:19,373 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 12:21:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash 56043189, now seen corresponding path program 1 times [2018-09-10 12:21:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:19,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:19,375 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:19,638 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:21:19,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:21:19,638 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:21:19,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:21:19,639 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:21:19,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:21:19,640 INFO L87 Difference]: Start difference. First operand 2143 states and 3219 transitions. Second operand 6 states. [2018-09-10 12:21:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:24,288 INFO L93 Difference]: Finished difference Result 6714 states and 10183 transitions. [2018-09-10 12:21:24,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:21:24,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-09-10 12:21:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:24,321 INFO L225 Difference]: With dead ends: 6714 [2018-09-10 12:21:24,321 INFO L226 Difference]: Without dead ends: 4577 [2018-09-10 12:21:24,340 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 12:21:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2018-09-10 12:21:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4541. [2018-09-10 12:21:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2018-09-10 12:21:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 6489 transitions. [2018-09-10 12:21:24,491 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 6489 transitions. Word has length 149 [2018-09-10 12:21:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:24,495 INFO L480 AbstractCegarLoop]: Abstraction has 4541 states and 6489 transitions. [2018-09-10 12:21:24,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:21:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 6489 transitions. [2018-09-10 12:21:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-10 12:21:24,509 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:24,509 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 12:21:24,509 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 12:21:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1667026356, now seen corresponding path program 1 times [2018-09-10 12:21:24,510 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:24,511 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:24,968 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:24,968 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 12:21:24,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:24,978 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:25,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:25,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:25,834 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:25,835 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:21:25,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:25,850 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:26,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:26,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:21:26,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:21:26,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-10 12:21:26,619 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:21:26,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:21:26,620 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:21:26,621 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:21:26,622 INFO L87 Difference]: Start difference. First operand 4541 states and 6489 transitions. Second operand 9 states. [2018-09-10 12:21:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:39,375 INFO L93 Difference]: Finished difference Result 12055 states and 18403 transitions. [2018-09-10 12:21:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:21:39,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 318 [2018-09-10 12:21:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:39,424 INFO L225 Difference]: With dead ends: 12055 [2018-09-10 12:21:39,424 INFO L226 Difference]: Without dead ends: 7520 [2018-09-10 12:21:39,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 1269 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:21:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2018-09-10 12:21:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 7468. [2018-09-10 12:21:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7468 states. [2018-09-10 12:21:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7468 states to 7468 states and 10097 transitions. [2018-09-10 12:21:39,718 INFO L78 Accepts]: Start accepts. Automaton has 7468 states and 10097 transitions. Word has length 318 [2018-09-10 12:21:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:39,718 INFO L480 AbstractCegarLoop]: Abstraction has 7468 states and 10097 transitions. [2018-09-10 12:21:39,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:21:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7468 states and 10097 transitions. [2018-09-10 12:21:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-09-10 12:21:39,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:39,765 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:39,765 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 12:21:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash -97477614, now seen corresponding path program 1 times [2018-09-10 12:21:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:39,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:39,767 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:21:40,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:40,612 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 12:21:40,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:40,629 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:40,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:21:41,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:21:41,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:41,578 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 12:21:41,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:41,600 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:41,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:21:42,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 12:21:42,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:21:42,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:21:42,663 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:21:42,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:21:42,664 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:21:42,664 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:21:42,673 INFO L87 Difference]: Start difference. First operand 7468 states and 10097 transitions. Second operand 9 states. [2018-09-10 12:21:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:50,259 INFO L93 Difference]: Finished difference Result 16547 states and 22725 transitions. [2018-09-10 12:21:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:21:50,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 508 [2018-09-10 12:21:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:50,309 INFO L225 Difference]: With dead ends: 16547 [2018-09-10 12:21:50,310 INFO L226 Difference]: Without dead ends: 9085 [2018-09-10 12:21:50,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2048 GetRequests, 2028 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-09-10 12:21:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2018-09-10 12:21:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 9020. [2018-09-10 12:21:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9020 states. [2018-09-10 12:21:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 11334 transitions. [2018-09-10 12:21:50,579 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 11334 transitions. Word has length 508 [2018-09-10 12:21:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:50,580 INFO L480 AbstractCegarLoop]: Abstraction has 9020 states and 11334 transitions. [2018-09-10 12:21:50,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:21:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 11334 transitions. [2018-09-10 12:21:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-09-10 12:21:50,612 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:50,613 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:50,613 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 12:21:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1399968243, now seen corresponding path program 1 times [2018-09-10 12:21:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:50,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:50,615 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:51,115 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:21:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 193 proven. 191 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 12:21:52,148 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:52,148 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:21:52,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:52,248 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:52,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:21:52,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:21:53,423 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:21:53,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-10 12:21:53,424 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:21:53,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:21:53,424 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:21:53,425 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:21:53,425 INFO L87 Difference]: Start difference. First operand 9020 states and 11334 transitions. Second operand 3 states. [2018-09-10 12:21:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:21:56,042 INFO L93 Difference]: Finished difference Result 18372 states and 23195 transitions. [2018-09-10 12:21:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:21:56,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2018-09-10 12:21:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:21:56,085 INFO L225 Difference]: With dead ends: 18372 [2018-09-10 12:21:56,085 INFO L226 Difference]: Without dead ends: 9358 [2018-09-10 12:21:56,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 1018 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:21:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2018-09-10 12:21:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 8673. [2018-09-10 12:21:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2018-09-10 12:21:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 10615 transitions. [2018-09-10 12:21:56,317 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 10615 transitions. Word has length 509 [2018-09-10 12:21:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:21:56,319 INFO L480 AbstractCegarLoop]: Abstraction has 8673 states and 10615 transitions. [2018-09-10 12:21:56,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:21:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 10615 transitions. [2018-09-10 12:21:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-09-10 12:21:56,354 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:21:56,355 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 12:21:56,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:21:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1694283942, now seen corresponding path program 1 times [2018-09-10 12:21:56,356 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:21:56,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:56,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:56,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:21:56,357 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:21:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:56,877 WARN L175 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:21:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 197 proven. 76 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-09-10 12:21:57,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:57,832 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:21:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:57,844 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:58,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-09-10 12:21:58,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-09-10 12:21:58,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:21:58,598 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 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:21:58,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:21:58,615 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:21:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:21:59,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:21:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-09-10 12:21:59,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:21:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-09-10 12:21:59,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:21:59,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 12:21:59,879 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:21:59,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:21:59,881 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:21:59,882 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-10 12:21:59,882 INFO L87 Difference]: Start difference. First operand 8673 states and 10615 transitions. Second operand 9 states. [2018-09-10 12:22:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:22:05,235 INFO L93 Difference]: Finished difference Result 17754 states and 21950 transitions. [2018-09-10 12:22:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:22:05,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 526 [2018-09-10 12:22:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:22:05,279 INFO L225 Difference]: With dead ends: 17754 [2018-09-10 12:22:05,279 INFO L226 Difference]: Without dead ends: 9087 [2018-09-10 12:22:05,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2119 GetRequests, 2098 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-09-10 12:22:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9087 states. [2018-09-10 12:22:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9087 to 8675. [2018-09-10 12:22:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8675 states. [2018-09-10 12:22:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8675 states to 8675 states and 10493 transitions. [2018-09-10 12:22:05,519 INFO L78 Accepts]: Start accepts. Automaton has 8675 states and 10493 transitions. Word has length 526 [2018-09-10 12:22:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:22:05,520 INFO L480 AbstractCegarLoop]: Abstraction has 8675 states and 10493 transitions. [2018-09-10 12:22:05,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:22:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8675 states and 10493 transitions. [2018-09-10 12:22:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2018-09-10 12:22:05,569 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:22:05,570 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-09-10 12:22:05,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:22:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash -95426106, now seen corresponding path program 1 times [2018-09-10 12:22:05,571 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:22:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:22:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:22:05,572 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:22:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-10 12:22:06,488 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:22:06,489 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:22:06,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:06,502 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:22:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:06,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:22:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-10 12:22:07,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:22:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-10 12:22:07,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:22:07,377 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 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:22:07,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:07,397 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:22:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:07,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:22:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-10 12:22:08,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:22:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 412 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-10 12:22:08,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:22:08,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-10 12:22:08,441 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:22:08,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:22:08,442 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:22:08,442 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:22:08,442 INFO L87 Difference]: Start difference. First operand 8675 states and 10493 transitions. Second operand 9 states. [2018-09-10 12:22:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:22:15,160 INFO L93 Difference]: Finished difference Result 29726 states and 38268 transitions. [2018-09-10 12:22:15,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 12:22:15,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 626 [2018-09-10 12:22:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:22:15,262 INFO L225 Difference]: With dead ends: 29726 [2018-09-10 12:22:15,263 INFO L226 Difference]: Without dead ends: 15521 [2018-09-10 12:22:15,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2527 GetRequests, 2503 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-09-10 12:22:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15521 states. [2018-09-10 12:22:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15521 to 15106. [2018-09-10 12:22:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15106 states. [2018-09-10 12:22:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15106 states to 15106 states and 17152 transitions. [2018-09-10 12:22:15,796 INFO L78 Accepts]: Start accepts. Automaton has 15106 states and 17152 transitions. Word has length 626 [2018-09-10 12:22:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:22:15,797 INFO L480 AbstractCegarLoop]: Abstraction has 15106 states and 17152 transitions. [2018-09-10 12:22:15,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:22:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15106 states and 17152 transitions. [2018-09-10 12:22:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-09-10 12:22:15,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:22:15,886 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:22:15,887 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:22:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2093475994, now seen corresponding path program 1 times [2018-09-10 12:22:15,887 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:22:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:22:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:22:15,891 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:22:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 632 proven. 215 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2018-09-10 12:22:17,195 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:22:17,196 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:22:17,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:17,209 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:22:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:17,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:22:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 1137 proven. 2 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-09-10 12:22:17,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:22:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 632 proven. 215 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2018-09-10 12:22:18,487 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:22:18,487 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 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:22:18,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:18,507 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:22:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:19,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:22:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 1137 proven. 2 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-09-10 12:22:19,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:22:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 632 proven. 215 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2018-09-10 12:22:20,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:22:20,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:22:20,126 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:22:20,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:22:20,129 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:22:20,129 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:22:20,129 INFO L87 Difference]: Start difference. First operand 15106 states and 17152 transitions. Second operand 9 states. [2018-09-10 12:22:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:22:25,775 INFO L93 Difference]: Finished difference Result 37106 states and 45848 transitions. [2018-09-10 12:22:25,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:22:25,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 880 [2018-09-10 12:22:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:22:26,009 INFO L225 Difference]: With dead ends: 37106 [2018-09-10 12:22:26,009 INFO L226 Difference]: Without dead ends: 22006 [2018-09-10 12:22:26,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3542 GetRequests, 3519 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:22:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22006 states. [2018-09-10 12:22:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22006 to 21984. [2018-09-10 12:22:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21984 states. [2018-09-10 12:22:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21984 states to 21984 states and 27232 transitions. [2018-09-10 12:22:27,076 INFO L78 Accepts]: Start accepts. Automaton has 21984 states and 27232 transitions. Word has length 880 [2018-09-10 12:22:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:22:27,077 INFO L480 AbstractCegarLoop]: Abstraction has 21984 states and 27232 transitions. [2018-09-10 12:22:27,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:22:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 21984 states and 27232 transitions. [2018-09-10 12:22:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2018-09-10 12:22:27,194 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:22:27,195 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:22:27,195 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:22:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash -204946437, now seen corresponding path program 1 times [2018-09-10 12:22:27,196 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:22:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:22:27,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:22:27,197 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:22:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 902 proven. 2 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-09-10 12:22:28,580 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:22:28,580 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:22:28,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:28,597 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:22:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:28,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:22:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 902 proven. 2 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-09-10 12:22:29,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:22:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 902 proven. 2 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-09-10 12:22:30,246 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:22:30,246 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 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:22:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:22:30,261 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:22:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:22:30,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:22:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 902 proven. 2 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-09-10 12:22:31,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:22:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 902 proven. 2 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-09-10 12:22:31,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:22:31,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:22:31,901 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:22:31,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:22:31,902 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:22:31,902 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:22:31,902 INFO L87 Difference]: Start difference. First operand 21984 states and 27232 transitions. Second operand 9 states. [2018-09-10 12:22:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:22:37,609 INFO L93 Difference]: Finished difference Result 51692 states and 63951 transitions. [2018-09-10 12:22:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-10 12:22:37,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 899 [2018-09-10 12:22:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:22:37,614 INFO L225 Difference]: With dead ends: 51692 [2018-09-10 12:22:37,614 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:22:37,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3622 GetRequests, 3596 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-09-10 12:22:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:22:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:22:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:22:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:22:37,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 899 [2018-09-10 12:22:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:22:37,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:22:37,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:22:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:22:37,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:22:37,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:22:37,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:38,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:39,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:40,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:40,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:40,671 WARN L175 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 511 DAG size of output: 410 [2018-09-10 12:22:41,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:41,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:42,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:43,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:43,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:22:43,444 WARN L175 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 511 DAG size of output: 410 [2018-09-10 12:22:47,644 WARN L175 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 411 DAG size of output: 53 [2018-09-10 12:22:49,841 WARN L175 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 279 DAG size of output: 50 [2018-09-10 12:22:53,594 WARN L175 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 411 DAG size of output: 53 [2018-09-10 12:22:54,780 WARN L175 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 250 DAG size of output: 50 [2018-09-10 12:22:56,028 WARN L175 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 284 DAG size of output: 50 [2018-09-10 12:22:56,032 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:22:56,032 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__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) [2018-09-10 12:22:56,032 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:22:56,032 INFO L426 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,032 INFO L426 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:22:56,033 INFO L426 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,034 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:22:56,034 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:22:56,034 INFO L422 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (.cse7 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse5 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse6 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse8 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse3 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (and .cse12 .cse9 .cse7 .cse10)) (.cse1 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156) 0)) (.cse11 (< 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse4 (and .cse12 .cse9 .cse10)) (.cse2 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 .cse6) (or .cse7 .cse1 .cse3 .cse8) (or .cse1 .cse7 .cse5 .cse3 .cse6) (or (and .cse9 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) .cse10) .cse8) (or .cse3 .cse4 .cse11) (or (not .cse3) .cse4 .cse2) (or .cse0 .cse1 .cse11) (or .cse4 .cse2 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)))))) [2018-09-10 12:22:56,034 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,034 INFO L426 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2018-09-10 12:22:56,034 INFO L426 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:22:56,035 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,036 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:22:56,037 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:22:56,037 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 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:22:56,038 INFO L426 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,039 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,040 INFO L426 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,041 INFO L426 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,042 INFO L426 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,043 INFO L426 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,044 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:22:56,045 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,046 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:22:56,047 INFO L426 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,048 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 202) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,048 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,049 INFO L426 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,050 INFO L426 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,051 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:22:56,052 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,053 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,054 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 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 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,055 INFO L426 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,056 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,057 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:22:56,058 INFO L426 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:22:56,059 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,060 INFO L426 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,061 INFO L426 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:22:56,062 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,063 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,064 INFO L426 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,065 INFO L426 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,066 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:22:56,067 INFO L426 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,067 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 23 1492) the Hoare annotation is: (let ((.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (.cse7 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse5 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse6 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse8 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse3 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (and .cse12 .cse9 .cse7 .cse10)) (.cse1 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156) 0)) (.cse11 (< 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse4 (and .cse12 .cse9 .cse10)) (.cse2 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 .cse6) (or .cse7 .cse1 .cse3 .cse8) (or .cse1 .cse7 .cse5 .cse3 .cse6) (or (and .cse9 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) .cse10) .cse8) (or .cse3 .cse4 .cse11) (or (not .cse3) .cse4 .cse2) (or .cse0 .cse1 .cse11) (or .cse4 .cse2 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)))))) [2018-09-10 12:22:56,068 INFO L426 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,068 INFO L426 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-09-10 12:22:56,068 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:22:56,068 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 87)) (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 3) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) [2018-09-10 12:22:56,068 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:22:56,068 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:22:56,068 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87) 0) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (<= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 87)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (< 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) [2018-09-10 12:22:56,068 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:22:56,068 INFO L422 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7)) (.cse4 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7))) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 3))) (let ((.cse1 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse0 (<= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse5 (and (and .cse7 (and (and .cse4 .cse8) .cse3)) .cse2)) (.cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0))) (or (and (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) .cse0) (and .cse1 .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 8)) (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87) 0) (and .cse2 .cse0 .cse3) (and .cse1 .cse4 .cse0) (and .cse1 .cse5 .cse6) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (< 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (and .cse7 .cse0 .cse3 .cse8) (and .cse2 .cse4 .cse0) (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (and .cse5 .cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))))) [2018-09-10 12:22:56,068 INFO L426 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1773-1(lines 1773 1782) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L422 ceAbstractionStarter]: At program point L1773-3(lines 1773 1782) the Hoare annotation is: (let ((.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7)) (.cse4 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7))) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 3))) (let ((.cse1 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse0 (<= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse5 (and (and .cse7 (and (and .cse4 .cse8) .cse3)) .cse2)) (.cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0))) (or (and (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) .cse0) (and .cse1 .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 8)) (< (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87) 0) (and .cse2 .cse0 .cse3) (and .cse1 .cse4 .cse0) (and .cse1 .cse5 .cse6) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (< 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (and .cse7 .cse0 .cse3 .cse8) (and .cse2 .cse4 .cse0) (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (and .cse5 .cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))))) [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1773-4(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,069 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:22:56,070 INFO L426 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,070 INFO L426 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,070 INFO L426 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,070 INFO L426 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,070 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (.cse7 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156))) (.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse5 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse6 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse8 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse3 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (and .cse12 .cse9 .cse7 .cse10)) (.cse1 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156) 0)) (.cse11 (< 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse4 (and .cse12 .cse9 .cse10)) (.cse2 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3 .cse6) (or .cse7 .cse1 .cse3 .cse8) (or .cse1 .cse7 .cse5 .cse3 .cse6) (or (and .cse9 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) .cse10) .cse8) (or .cse3 .cse4 .cse11) (or (not .cse3) .cse2 .cse4) (or .cse0 .cse1 .cse11) (or .cse4 .cse2 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)))))) [2018-09-10 12:22:56,070 INFO L426 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,070 INFO L426 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,071 INFO L426 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,072 INFO L426 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,073 INFO L426 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,074 INFO L426 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-09-10 12:22:56,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:22:56 BoogieIcfgContainer [2018-09-10 12:22:56,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:22:56,096 INFO L168 Benchmark]: Toolchain (without parser) took 126839.77 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -140.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-10 12:22:56,097 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 12:22:56,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1195.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-09-10 12:22:56,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 225.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:22:56,099 INFO L168 Benchmark]: Boogie Preprocessor took 437.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 825.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -974.1 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2018-09-10 12:22:56,100 INFO L168 Benchmark]: RCFGBuilder took 6819.80 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 280.5 MB). Peak memory consumption was 280.5 MB. Max. memory is 7.1 GB. [2018-09-10 12:22:56,101 INFO L168 Benchmark]: TraceAbstraction took 118155.10 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 426.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-10 12:22:56,106 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 1195.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 225.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 437.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 825.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -974.1 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6819.80 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 280.5 MB). Peak memory consumption was 280.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118155.10 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 426.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 202]: 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: 1773]: Loop Invariant Derived loop invariant: (((((((((((9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 && 10 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || ((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 && 10 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 8)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18) + 87 < 0) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 <= 3 && 10 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7))) || ((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156) && 10 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || ((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 7 && (0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 <= 3) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || 12 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || 3 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 7 && 10 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 <= 3 && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156) && 10 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || !(5 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12))) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 7 && (0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 <= 3) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. SAFE Result, 118.0s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 71.9s AutomataDifference, 0.0s DeadEndRemovalTime, 18.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1787 SDtfs, 22576 SDslu, 1750 SDs, 0 SdLazy, 32718 SolverSat, 7864 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 58.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16213 GetRequests, 16041 SyntacticMatches, 35 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21984occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2080 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 1950 PreInvPairs, 5579 NumberOfFragments, 917 HoareAnnotationTreeSize, 1950 FomulaSimplifications, 491536 FormulaSimplificationTreeSizeReduction, 5.8s HoareSimplificationTime, 9 FomulaSimplificationsInter, 365420 FormulaSimplificationTreeSizeReductionInter, 12.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 12797 NumberOfCodeBlocks, 12797 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 20783 ConstructedInterpolants, 0 QuantifiedInterpolants, 25602566 SizeOfPredicates, 2 NumberOfNonLiveVariables, 11266 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 27520/28484 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/Problem16_label47_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-22-56-124.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label47_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-22-56-124.csv Received shutdown request...