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/Problem03_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:27:31,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:27:31,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:27:31,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:27:31,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:27:31,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:27:31,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:27:31,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:27:31,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:27:31,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:27:31,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:27:31,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:27:31,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:27:31,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:27:31,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:27:31,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:27:31,247 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:27:31,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:27:31,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:27:31,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:27:31,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:27:31,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:27:31,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:27:31,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:27:31,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:27:31,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:27:31,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:27:31,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:27:31,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:27:31,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:27:31,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:27:31,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:27:31,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:27:31,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:27:31,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:27:31,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:27:31,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:27:31,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:27:31,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:27:31,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:27:31,300 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:27:31,301 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:27:31,302 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:27:31,302 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:27:31,302 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:27:31,302 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:27:31,302 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:27:31,303 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:27:31,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:27:31,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:27:31,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:27:31,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:27:31,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:27:31,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:27:31,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:27:31,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:27:31,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:27:31,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:27:31,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:27:31,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:27:31,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:27:31,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:27:31,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:27:31,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:27:31,309 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:27:31,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:27:31,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:27:31,309 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:27:31,310 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:27:31,310 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:27:31,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:27:31,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:27:31,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:27:31,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:27:31,400 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:27:31,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c [2018-09-10 10:27:31,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bf69ca1/e96af0f87621424c863ad9a3fb126958/FLAG490bd955e [2018-09-10 10:27:32,164 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:27:32,165 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c [2018-09-10 10:27:32,193 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bf69ca1/e96af0f87621424c863ad9a3fb126958/FLAG490bd955e [2018-09-10 10:27:32,214 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bf69ca1/e96af0f87621424c863ad9a3fb126958 [2018-09-10 10:27:32,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:27:32,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:27:32,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:27:32,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:27:32,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:27:32,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:27:32" (1/1) ... [2018-09-10 10:27:32,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4febdb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:32, skipping insertion in model container [2018-09-10 10:27:32,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:27:32" (1/1) ... [2018-09-10 10:27:32,495 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:27:33,007 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:27:33,028 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:27:33,317 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:27:33,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33 WrapperNode [2018-09-10 10:27:33,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:27:33,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:27:33,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:27:33,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:27:33,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:27:33,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:27:33,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:27:33,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:27:33,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... [2018-09-10 10:27:33,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:27:33,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:27:33,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:27:33,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:27:33,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:27:34,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:27:34,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:27:34,026 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 10:27:34,026 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 10:27:34,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:27:34,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:27:34,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:27:34,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:27:39,383 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:27:39,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:27:39 BoogieIcfgContainer [2018-09-10 10:27:39,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:27:39,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:27:39,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:27:39,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:27:39,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:27:32" (1/3) ... [2018-09-10 10:27:39,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245453d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:27:39, skipping insertion in model container [2018-09-10 10:27:39,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:27:33" (2/3) ... [2018-09-10 10:27:39,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245453d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:27:39, skipping insertion in model container [2018-09-10 10:27:39,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:27:39" (3/3) ... [2018-09-10 10:27:39,395 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label29_true-unreach-call.c [2018-09-10 10:27:39,406 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:27:39,417 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:27:39,491 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:27:39,492 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:27:39,492 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:27:39,492 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:27:39,492 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:27:39,492 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:27:39,492 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:27:39,493 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:27:39,493 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:27:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-10 10:27:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-10 10:27:39,560 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:39,562 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:39,563 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 10:27:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -676360028, now seen corresponding path program 1 times [2018-09-10 10:27:39,573 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:39,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:39,632 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:40,476 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:27:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:27:40,691 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:27:40,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:27:40,692 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:40,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:27:40,718 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:27:40,719 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:27:40,722 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-09-10 10:27:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:42,837 INFO L93 Difference]: Finished difference Result 855 states and 1508 transitions. [2018-09-10 10:27:42,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:27:42,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2018-09-10 10:27:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:27:42,864 INFO L225 Difference]: With dead ends: 855 [2018-09-10 10:27:42,865 INFO L226 Difference]: Without dead ends: 541 [2018-09-10 10:27:42,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:27:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-09-10 10:27:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 527. [2018-09-10 10:27:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-10 10:27:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 901 transitions. [2018-09-10 10:27:42,966 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 901 transitions. Word has length 185 [2018-09-10 10:27:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:27:42,968 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 901 transitions. [2018-09-10 10:27:42,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:27:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 901 transitions. [2018-09-10 10:27:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-10 10:27:42,978 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:42,978 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:42,979 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 10:27:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1122546461, now seen corresponding path program 1 times [2018-09-10 10:27:42,980 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:42,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:42,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:42,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:42,982 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:27:43,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:27:43,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:27:43,406 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:43,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:27:43,414 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:27:43,414 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:27:43,414 INFO L87 Difference]: Start difference. First operand 527 states and 901 transitions. Second operand 6 states. [2018-09-10 10:27:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:46,942 INFO L93 Difference]: Finished difference Result 1495 states and 2644 transitions. [2018-09-10 10:27:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:27:46,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2018-09-10 10:27:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:27:46,952 INFO L225 Difference]: With dead ends: 1495 [2018-09-10 10:27:46,952 INFO L226 Difference]: Without dead ends: 974 [2018-09-10 10:27:46,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:27:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-09-10 10:27:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 953. [2018-09-10 10:27:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-09-10 10:27:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1539 transitions. [2018-09-10 10:27:47,016 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1539 transitions. Word has length 195 [2018-09-10 10:27:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:27:47,017 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1539 transitions. [2018-09-10 10:27:47,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:27:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1539 transitions. [2018-09-10 10:27:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-10 10:27:47,024 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:47,024 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:47,024 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 10:27:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 439964576, now seen corresponding path program 1 times [2018-09-10 10:27:47,025 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:47,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:47,026 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:27:47,298 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:27:47,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:27:47,298 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:47,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:27:47,301 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:27:47,301 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:27:47,302 INFO L87 Difference]: Start difference. First operand 953 states and 1539 transitions. Second operand 3 states. [2018-09-10 10:27:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:50,195 INFO L93 Difference]: Finished difference Result 2749 states and 4576 transitions. [2018-09-10 10:27:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:27:50,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-09-10 10:27:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:27:50,217 INFO L225 Difference]: With dead ends: 2749 [2018-09-10 10:27:50,217 INFO L226 Difference]: Without dead ends: 1802 [2018-09-10 10:27:50,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:27:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-09-10 10:27:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1797. [2018-09-10 10:27:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-10 10:27:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2800 transitions. [2018-09-10 10:27:50,316 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2800 transitions. Word has length 198 [2018-09-10 10:27:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:27:50,317 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2800 transitions. [2018-09-10 10:27:50,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:27:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2800 transitions. [2018-09-10 10:27:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-10 10:27:50,329 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:50,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:50,331 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 10:27:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 310290543, now seen corresponding path program 1 times [2018-09-10 10:27:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:50,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:50,333 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:27:50,717 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:27:50,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:27:50,718 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:50,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:27:50,719 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:27:50,719 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:27:50,719 INFO L87 Difference]: Start difference. First operand 1797 states and 2800 transitions. Second operand 3 states. [2018-09-10 10:27:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:52,347 INFO L93 Difference]: Finished difference Result 5275 states and 8522 transitions. [2018-09-10 10:27:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:27:52,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-09-10 10:27:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:27:52,380 INFO L225 Difference]: With dead ends: 5275 [2018-09-10 10:27:52,381 INFO L226 Difference]: Without dead ends: 3484 [2018-09-10 10:27:52,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:27:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2018-09-10 10:27:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3482. [2018-09-10 10:27:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2018-09-10 10:27:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 5332 transitions. [2018-09-10 10:27:52,507 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 5332 transitions. Word has length 218 [2018-09-10 10:27:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:27:52,508 INFO L480 AbstractCegarLoop]: Abstraction has 3482 states and 5332 transitions. [2018-09-10 10:27:52,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:27:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 5332 transitions. [2018-09-10 10:27:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-10 10:27:52,524 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:52,524 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:52,524 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 10:27:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1130070655, now seen corresponding path program 1 times [2018-09-10 10:27:52,525 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:52,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:52,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:52,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:52,526 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:52,799 WARN L175 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:27:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:27:52,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:27:52,961 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:27:52,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:52,978 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:27:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:53,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:27:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:27:53,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:27:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:27:53,592 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:27:53,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2018-09-10 10:27:53,592 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:53,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:27:53,593 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:27:53,594 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:27:53,594 INFO L87 Difference]: Start difference. First operand 3482 states and 5332 transitions. Second operand 3 states. [2018-09-10 10:27:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:54,485 INFO L93 Difference]: Finished difference Result 6957 states and 10664 transitions. [2018-09-10 10:27:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:27:54,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-09-10 10:27:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:27:54,508 INFO L225 Difference]: With dead ends: 6957 [2018-09-10 10:27:54,509 INFO L226 Difference]: Without dead ends: 3481 [2018-09-10 10:27:54,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:27:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2018-09-10 10:27:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3481. [2018-09-10 10:27:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3481 states. [2018-09-10 10:27:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5329 transitions. [2018-09-10 10:27:54,628 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5329 transitions. Word has length 221 [2018-09-10 10:27:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:27:54,629 INFO L480 AbstractCegarLoop]: Abstraction has 3481 states and 5329 transitions. [2018-09-10 10:27:54,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:27:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5329 transitions. [2018-09-10 10:27:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-10 10:27:54,645 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:54,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:54,646 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 10:27:54,646 INFO L82 PathProgramCache]: Analyzing trace with hash 928058239, now seen corresponding path program 1 times [2018-09-10 10:27:54,646 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:54,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:54,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:54,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:54,648 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:27:54,847 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:27:54,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:27:54,847 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:54,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:27:54,848 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:27:54,848 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:27:54,848 INFO L87 Difference]: Start difference. First operand 3481 states and 5329 transitions. Second operand 6 states. [2018-09-10 10:27:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:57,351 INFO L93 Difference]: Finished difference Result 10855 states and 17962 transitions. [2018-09-10 10:27:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:27:57,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2018-09-10 10:27:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:27:57,397 INFO L225 Difference]: With dead ends: 10855 [2018-09-10 10:27:57,397 INFO L226 Difference]: Without dead ends: 7380 [2018-09-10 10:27:57,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:27:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2018-09-10 10:27:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 7292. [2018-09-10 10:27:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2018-09-10 10:27:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 10955 transitions. [2018-09-10 10:27:57,641 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 10955 transitions. Word has length 226 [2018-09-10 10:27:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:27:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 7292 states and 10955 transitions. [2018-09-10 10:27:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:27:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 10955 transitions. [2018-09-10 10:27:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-10 10:27:57,672 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:27:57,673 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:27:57,673 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 10:27:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1664494589, now seen corresponding path program 1 times [2018-09-10 10:27:57,674 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:27:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:57,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:27:57,675 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:27:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 59 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:27:58,172 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:27:58,172 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:27:58,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:27:58,190 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:27:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:27:58,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:27:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:27:58,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:27:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:27:58,865 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:27:58,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-09-10 10:27:58,866 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:27:58,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:27:58,867 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:27:58,867 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:27:58,867 INFO L87 Difference]: Start difference. First operand 7292 states and 10955 transitions. Second operand 3 states. [2018-09-10 10:28:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:28:01,386 INFO L93 Difference]: Finished difference Result 14581 states and 21959 transitions. [2018-09-10 10:28:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:28:01,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-09-10 10:28:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:28:01,423 INFO L225 Difference]: With dead ends: 14581 [2018-09-10 10:28:01,423 INFO L226 Difference]: Without dead ends: 7295 [2018-09-10 10:28:01,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:28:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2018-09-10 10:28:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 7292. [2018-09-10 10:28:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2018-09-10 10:28:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 10252 transitions. [2018-09-10 10:28:01,663 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 10252 transitions. Word has length 239 [2018-09-10 10:28:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:28:01,664 INFO L480 AbstractCegarLoop]: Abstraction has 7292 states and 10252 transitions. [2018-09-10 10:28:01,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:28:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 10252 transitions. [2018-09-10 10:28:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-10 10:28:01,690 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:28:01,690 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:28:01,691 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 10:28:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 775089041, now seen corresponding path program 1 times [2018-09-10 10:28:01,691 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:28:01,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:01,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:01,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:01,693 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:28:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 67 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:28:02,212 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:28:02,212 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:28:02,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:02,228 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:28:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:02,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:28:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-10 10:28:02,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:28:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-10 10:28:02,881 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:28:02,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:28:02,882 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:28:02,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:28:02,883 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:28:02,883 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:28:02,884 INFO L87 Difference]: Start difference. First operand 7292 states and 10252 transitions. Second operand 3 states. [2018-09-10 10:28:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:28:04,835 INFO L93 Difference]: Finished difference Result 18226 states and 25807 transitions. [2018-09-10 10:28:04,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:28:04,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-09-10 10:28:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:28:04,894 INFO L225 Difference]: With dead ends: 18226 [2018-09-10 10:28:04,895 INFO L226 Difference]: Without dead ends: 10940 [2018-09-10 10:28:04,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 492 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:28:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10940 states. [2018-09-10 10:28:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10940 to 10931. [2018-09-10 10:28:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10931 states. [2018-09-10 10:28:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10931 states to 10931 states and 14936 transitions. [2018-09-10 10:28:05,192 INFO L78 Accepts]: Start accepts. Automaton has 10931 states and 14936 transitions. Word has length 247 [2018-09-10 10:28:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:28:05,193 INFO L480 AbstractCegarLoop]: Abstraction has 10931 states and 14936 transitions. [2018-09-10 10:28:05,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:28:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10931 states and 14936 transitions. [2018-09-10 10:28:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-10 10:28:05,237 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:28:05,238 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:28:05,238 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 10:28:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash -678271507, now seen corresponding path program 1 times [2018-09-10 10:28:05,238 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:28:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:05,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:05,240 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:28:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 81 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:28:05,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:28:05,795 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:28:05,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:05,812 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:28:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:06,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:28:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:28:06,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:28:06,744 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-10 10:28:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:28:06,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:28:06,971 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:28:06,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:06,988 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:28:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:07,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:28:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:28:08,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:28:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:28:08,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:28:08,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 10:28:08,508 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:28:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:28:08,510 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:28:08,510 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:28:08,510 INFO L87 Difference]: Start difference. First operand 10931 states and 14936 transitions. Second operand 9 states. [2018-09-10 10:28:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:28:12,141 INFO L93 Difference]: Finished difference Result 22067 states and 30982 transitions. [2018-09-10 10:28:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 10:28:12,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2018-09-10 10:28:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:28:12,185 INFO L225 Difference]: With dead ends: 22067 [2018-09-10 10:28:12,185 INFO L226 Difference]: Without dead ends: 11142 [2018-09-10 10:28:12,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1039 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:28:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2018-09-10 10:28:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10989. [2018-09-10 10:28:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10989 states. [2018-09-10 10:28:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10989 states to 10989 states and 13884 transitions. [2018-09-10 10:28:12,442 INFO L78 Accepts]: Start accepts. Automaton has 10989 states and 13884 transitions. Word has length 261 [2018-09-10 10:28:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:28:12,442 INFO L480 AbstractCegarLoop]: Abstraction has 10989 states and 13884 transitions. [2018-09-10 10:28:12,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:28:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10989 states and 13884 transitions. [2018-09-10 10:28:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-10 10:28:12,469 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:28:12,469 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:28:12,469 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 10:28:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2092297846, now seen corresponding path program 1 times [2018-09-10 10:28:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:28:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:12,471 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:28:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:13,092 WARN L175 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:28:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:28:13,222 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:28:13,222 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 10:28:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:13,230 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:28:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:13,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:28:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-09-10 10:28:13,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:28:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:28:13,697 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:28:13,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2018-09-10 10:28:13,697 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:28:13,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:28:13,698 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:28:13,698 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:28:13,699 INFO L87 Difference]: Start difference. First operand 10989 states and 13884 transitions. Second operand 5 states. [2018-09-10 10:28:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:28:16,111 INFO L93 Difference]: Finished difference Result 31263 states and 41347 transitions. [2018-09-10 10:28:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:28:16,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2018-09-10 10:28:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:28:16,195 INFO L225 Difference]: With dead ends: 31263 [2018-09-10 10:28:16,195 INFO L226 Difference]: Without dead ends: 20280 [2018-09-10 10:28:16,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:28:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2018-09-10 10:28:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 18981. [2018-09-10 10:28:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18981 states. [2018-09-10 10:28:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18981 states to 18981 states and 23481 transitions. [2018-09-10 10:28:16,649 INFO L78 Accepts]: Start accepts. Automaton has 18981 states and 23481 transitions. Word has length 276 [2018-09-10 10:28:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:28:16,649 INFO L480 AbstractCegarLoop]: Abstraction has 18981 states and 23481 transitions. [2018-09-10 10:28:16,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:28:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18981 states and 23481 transitions. [2018-09-10 10:28:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-10 10:28:16,671 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:28:16,672 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:28:16,672 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 10:28:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1427629429, now seen corresponding path program 1 times [2018-09-10 10:28:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:28:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:28:16,673 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:28:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:17,267 WARN L175 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:28:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:28:17,488 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:28:17,488 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:28:17,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:17,499 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:28:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:17,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:28:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:28:17,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:28:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:28:18,131 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:28:18,131 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:28:18,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:28:18,146 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:28:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:28:18,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:28:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:28:18,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:28:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:28:18,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:28:18,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6, 6, 4] total 15 [2018-09-10 10:28:18,894 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:28:18,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:28:18,895 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:28:18,895 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:28:18,895 INFO L87 Difference]: Start difference. First operand 18981 states and 23481 transitions. Second operand 3 states. [2018-09-10 10:28:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:28:20,350 INFO L93 Difference]: Finished difference Result 37711 states and 46706 transitions. [2018-09-10 10:28:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:28:20,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-09-10 10:28:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:28:20,351 INFO L225 Difference]: With dead ends: 37711 [2018-09-10 10:28:20,351 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:28:20,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1131 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:28:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:28:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:28:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:28:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:28:20,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 285 [2018-09-10 10:28:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:28:20,399 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:28:20,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:28:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:28:20,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:28:20,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:28:20,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:20,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:20,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:20,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:20,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,294 WARN L175 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 178 [2018-09-10 10:28:21,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:28:21,715 WARN L175 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 178 [2018-09-10 10:28:21,927 WARN L175 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-10 10:28:22,329 WARN L175 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-09-10 10:28:26,268 WARN L175 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 233 DAG size of output: 67 [2018-09-10 10:28:27,276 WARN L175 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 176 DAG size of output: 49 [2018-09-10 10:28:28,151 WARN L175 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 49 [2018-09-10 10:28:28,153 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:28:28,154 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)) [2018-09-10 10:28:28,154 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:28:28,154 INFO L426 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2018-09-10 10:28:28,154 INFO L426 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2018-09-10 10:28:28,154 INFO L426 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,154 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,154 INFO L426 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,155 INFO L426 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,155 INFO L426 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,155 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,155 INFO L426 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,155 INFO L426 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2018-09-10 10:28:28,157 INFO L426 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2018-09-10 10:28:28,158 INFO L426 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,159 INFO L426 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,160 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 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,160 INFO L426 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2018-09-10 10:28:28,161 INFO L426 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,162 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,163 INFO L426 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,164 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,165 INFO L426 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2018-09-10 10:28:28,166 INFO L426 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,167 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2018-09-10 10:28:28,168 INFO L426 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,169 INFO L426 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,170 INFO L426 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,171 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 1569) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,171 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,172 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2018-09-10 10:28:28,173 INFO L426 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,174 INFO L426 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,175 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 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,175 INFO L426 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,176 INFO L426 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,177 INFO L426 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,178 INFO L426 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,179 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,180 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2018-09-10 10:28:28,181 INFO L426 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,182 INFO L426 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2018-09-10 10:28:28,183 INFO L426 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,184 INFO L426 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,185 INFO L426 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:28:28,186 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 54 1650) the Hoare annotation is: (let ((.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|)) (.cse15 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)) (.cse16 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)) (.cse6 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)|))) (let ((.cse9 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse2 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| 1)) (.cse8 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse12 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|))) (.cse18 (not .cse6)) (.cse5 (and .cse13 .cse14 .cse15 .cse16 .cse17)) (.cse4 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|)) (.cse0 (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|)) (.cse1 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|))) (.cse10 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0 1))) (.cse11 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)|)) (.cse3 (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0))) (.cse7 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse3 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse6 .cse3 .cse7) (or .cse9 (or .cse1 .cse12 .cse3 .cse7 .cse8)) (or .cse1 (and .cse13 .cse14 .cse9 .cse15 .cse16 .cse17) .cse3 .cse4 .cse8) (or (and .cse13 .cse15 .cse16 .cse17 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) .cse1 .cse3 .cse7) (or .cse10 .cse1 .cse12 .cse11 .cse3 .cse4) (or .cse0 .cse1 .cse3 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse11 .cse10 .cse3 .cse4) (or .cse1 .cse10 .cse18 .cse11 .cse3 .cse4) (or .cse1 .cse18 .cse11 .cse3 .cse5 .cse4) (or .cse10 .cse0 .cse1 .cse11 .cse3 .cse4 .cse8) (or .cse1 (and .cse14 .cse15 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0) .cse16 .cse17) .cse12 .cse3 .cse4) (or .cse0 .cse1 .cse18 .cse5 .cse3 .cse4) (or .cse0 .cse1 .cse10 .cse11 .cse3 .cse7)))) [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:28:28,186 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0 1)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0) (<= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 2))) [2018-09-10 10:28:28,187 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:28:28,187 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:28:28,187 INFO L426 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-09-10 10:28:28,187 INFO L426 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2018-09-10 10:28:28,187 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1652 1669) the Hoare annotation is: (or (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|)) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0 1)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| 1) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)|) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)|) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|)) [2018-09-10 10:28:28,187 INFO L426 ceAbstractionStarter]: For program point L1658-1(lines 1658 1668) no Hoare annotation was computed. [2018-09-10 10:28:28,187 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1652 1669) no Hoare annotation was computed. [2018-09-10 10:28:28,188 INFO L422 ceAbstractionStarter]: At program point L1658-3(lines 1658 1668) the Hoare annotation is: (let ((.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 2))) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)) (.cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 0))) (or (and .cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)|) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)) (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) .cse0 .cse1) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|)) (and .cse0 (<= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0) .cse1 .cse2) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)|) (and .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)) (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|) (and .cse3 .cse0 .cse1 .cse2) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| 1) (and .cse3 (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0 1)) .cse0 .cse1)))) [2018-09-10 10:28:28,188 INFO L426 ceAbstractionStarter]: For program point L1658-4(lines 1652 1669) no Hoare annotation was computed. [2018-09-10 10:28:28,188 INFO L422 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 2))) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)) (.cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 0))) (or (and .cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11~0)|) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)) (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) .cse0 .cse1) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|)) (and .cse0 (<= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0) .cse1 .cse2) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)|) (and .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)) (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|) (and .cse3 .cse0 .cse1 .cse2) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)| 1) (and .cse3 (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0 1)) .cse0 .cse1)))) [2018-09-10 10:28:28,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:28:28 BoogieIcfgContainer [2018-09-10 10:28:28,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:28:28,210 INFO L168 Benchmark]: Toolchain (without parser) took 55983.91 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -559.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-10 10:28:28,212 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:28:28,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1199.43 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:28:28,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 160.19 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:28:28,214 INFO L168 Benchmark]: Boogie Preprocessor took 352.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -939.3 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:28:28,215 INFO L168 Benchmark]: RCFGBuilder took 5440.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 281.2 MB). Peak memory consumption was 281.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:28:28,216 INFO L168 Benchmark]: TraceAbstraction took 48824.14 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 705.7 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -7.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-10 10:28:28,221 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.27 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 1199.43 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 160.19 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 352.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -939.3 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5440.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 281.2 MB). Peak memory consumption was 281.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48824.14 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 705.7 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -7.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1569]: 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: 1658]: Loop Invariant Derived loop invariant: (((((((((((((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27))) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6)) || !(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18)) || ((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6 <= 0)) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5))) || (((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && 1 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 2))) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26)) || ((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6 <= 0) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27)) || 2 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 2))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) < 1) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a11 && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26 == 1) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. SAFE Result, 48.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 26.1s AutomataDifference, 0.0s DeadEndRemovalTime, 7.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2880 SDtfs, 6580 SDslu, 1123 SDs, 0 SdLazy, 10072 SolverSat, 2328 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4231 GetRequests, 4140 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18981occurred 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: 1.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 1594 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 373 PreInvPairs, 533 NumberOfFragments, 721 HoareAnnotationTreeSize, 373 FomulaSimplifications, 12428 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12001 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 4626 NumberOfCodeBlocks, 4626 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6674 ConstructedInterpolants, 0 QuantifiedInterpolants, 3672974 SizeOfPredicates, 19 NumberOfNonLiveVariables, 9144 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 1987/2101 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/Problem03_label29_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-28-28-241.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label29_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-28-28-241.csv Received shutdown request...