java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:17:24,224 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:17:24,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:17:24,237 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:17:24,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:17:24,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:17:24,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:17:24,243 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:17:24,245 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:17:24,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:17:24,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:17:24,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:17:24,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:17:24,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:17:24,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:17:24,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:17:24,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:17:24,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:17:24,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:17:24,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:17:24,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:17:24,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:17:24,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:17:24,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:17:24,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:17:24,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:17:24,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:17:24,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:17:24,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:17:24,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:17:24,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:17:24,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:17:24,280 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:17:24,280 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:17:24,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:17:24,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:17:24,282 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 12:17:24,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:17:24,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:17:24,310 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:17:24,310 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:17:24,310 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:17:24,310 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:17:24,310 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:17:24,311 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:17:24,311 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:17:24,311 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:17:24,311 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:17:24,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:17:24,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:17:24,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:17:24,313 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:17:24,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:17:24,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:17:24,314 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:17:24,315 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:17:24,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:17:24,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:17:24,316 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:17:24,316 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:17:24,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:17:24,316 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:17:24,316 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:17:24,317 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:17:24,317 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:17:24,317 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:17:24,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:17:24,317 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:17:24,318 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:17:24,318 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:17:24,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:17:24,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:17:24,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:17:24,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:17:24,406 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:17:24,407 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label12_true-unreach-call.c [2018-09-10 12:17:24,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6cfc78cf/d7e8240fb114453a8e72f029ff908e3b/FLAG6decd2b3f [2018-09-10 12:17:25,082 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:17:25,083 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label12_true-unreach-call.c [2018-09-10 12:17:25,101 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6cfc78cf/d7e8240fb114453a8e72f029ff908e3b/FLAG6decd2b3f [2018-09-10 12:17:25,116 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6cfc78cf/d7e8240fb114453a8e72f029ff908e3b [2018-09-10 12:17:25,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:17:25,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:17:25,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:17:25,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:17:25,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:17:25,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:17:25" (1/1) ... [2018-09-10 12:17:25,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f9d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:25, skipping insertion in model container [2018-09-10 12:17:25,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:17:25" (1/1) ... [2018-09-10 12:17:25,437 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:17:26,004 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:17:26,023 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:17:26,327 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:17:26,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26 WrapperNode [2018-09-10 12:17:26,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:17:26,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:17:26,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:17:26,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:17:26,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:26,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:26,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:17:26,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:17:26,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:17:26,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:17:26,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:26,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:26,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:26,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:27,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:27,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:27,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... [2018-09-10 12:17:27,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:17:27,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:17:27,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:17:27,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:17:27,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:17:27,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:17:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:17:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 12:17:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 12:17:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:17:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:17:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:17:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:17:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 12:17:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 12:17:33,206 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:17:33,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:17:33 BoogieIcfgContainer [2018-09-10 12:17:33,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:17:33,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:17:33,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:17:33,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:17:33,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:17:25" (1/3) ... [2018-09-10 12:17:33,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4370eccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:17:33, skipping insertion in model container [2018-09-10 12:17:33,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:26" (2/3) ... [2018-09-10 12:17:33,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4370eccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:17:33, skipping insertion in model container [2018-09-10 12:17:33,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:17:33" (3/3) ... [2018-09-10 12:17:33,216 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label12_true-unreach-call.c [2018-09-10 12:17:33,226 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:17:33,235 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:17:33,293 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:17:33,294 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:17:33,294 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:17:33,294 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:17:33,294 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:17:33,294 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:17:33,294 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:17:33,294 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:17:33,295 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:17:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-10 12:17:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-10 12:17:33,340 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:33,341 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] [2018-09-10 12:17:33,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash -215571324, now seen corresponding path program 1 times [2018-09-10 12:17:33,349 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:33,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:33,399 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:33,863 WARN L175 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:17:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:33,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:33,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 12:17:33,972 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:33,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:17:33,995 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:17:33,996 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:17:33,998 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-09-10 12:17:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:37,213 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-09-10 12:17:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:17:37,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-09-10 12:17:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:37,243 INFO L225 Difference]: With dead ends: 1156 [2018-09-10 12:17:37,243 INFO L226 Difference]: Without dead ends: 744 [2018-09-10 12:17:37,252 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 12:17:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-09-10 12:17:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-09-10 12:17:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-10 12:17:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1317 transitions. [2018-09-10 12:17:37,371 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1317 transitions. Word has length 46 [2018-09-10 12:17:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:37,372 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1317 transitions. [2018-09-10 12:17:37,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:17:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1317 transitions. [2018-09-10 12:17:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-10 12:17:37,379 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:37,380 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:17:37,380 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash -323450106, now seen corresponding path program 1 times [2018-09-10 12:17:37,381 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:37,383 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:37,714 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:37,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:37,714 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:37,717 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:37,717 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:37,717 INFO L87 Difference]: Start difference. First operand 744 states and 1317 transitions. Second operand 6 states. [2018-09-10 12:17:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:45,334 INFO L93 Difference]: Finished difference Result 2840 states and 5175 transitions. [2018-09-10 12:17:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:45,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-09-10 12:17:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:45,353 INFO L225 Difference]: With dead ends: 2840 [2018-09-10 12:17:45,353 INFO L226 Difference]: Without dead ends: 2102 [2018-09-10 12:17:45,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2018-09-10 12:17:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2081. [2018-09-10 12:17:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-09-10 12:17:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3312 transitions. [2018-09-10 12:17:45,447 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3312 transitions. Word has length 122 [2018-09-10 12:17:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:45,448 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 3312 transitions. [2018-09-10 12:17:45,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3312 transitions. [2018-09-10 12:17:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-10 12:17:45,452 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:45,453 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:17:45,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 177851930, now seen corresponding path program 1 times [2018-09-10 12:17:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:45,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:45,455 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:45,736 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:45,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:45,736 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:45,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:45,737 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:45,737 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:45,738 INFO L87 Difference]: Start difference. First operand 2081 states and 3312 transitions. Second operand 6 states. [2018-09-10 12:17:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:50,476 INFO L93 Difference]: Finished difference Result 4872 states and 7867 transitions. [2018-09-10 12:17:50,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:50,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-09-10 12:17:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:50,494 INFO L225 Difference]: With dead ends: 4872 [2018-09-10 12:17:50,494 INFO L226 Difference]: Without dead ends: 2797 [2018-09-10 12:17:50,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2018-09-10 12:17:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2772. [2018-09-10 12:17:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-09-10 12:17:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 4108 transitions. [2018-09-10 12:17:50,587 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 4108 transitions. Word has length 128 [2018-09-10 12:17:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:50,587 INFO L480 AbstractCegarLoop]: Abstraction has 2772 states and 4108 transitions. [2018-09-10 12:17:50,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4108 transitions. [2018-09-10 12:17:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-10 12:17:50,590 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:50,591 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:17:50,591 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1047354685, now seen corresponding path program 1 times [2018-09-10 12:17:50,591 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:50,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:50,593 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:50,832 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:50,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:50,832 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:50,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:50,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:50,833 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:50,833 INFO L87 Difference]: Start difference. First operand 2772 states and 4108 transitions. Second operand 6 states. [2018-09-10 12:17:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:55,524 INFO L93 Difference]: Finished difference Result 7301 states and 11345 transitions. [2018-09-10 12:17:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:55,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-09-10 12:17:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:55,560 INFO L225 Difference]: With dead ends: 7301 [2018-09-10 12:17:55,560 INFO L226 Difference]: Without dead ends: 4535 [2018-09-10 12:17:55,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2018-09-10 12:17:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4515. [2018-09-10 12:17:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2018-09-10 12:17:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6567 transitions. [2018-09-10 12:17:55,712 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6567 transitions. Word has length 131 [2018-09-10 12:17:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:55,713 INFO L480 AbstractCegarLoop]: Abstraction has 4515 states and 6567 transitions. [2018-09-10 12:17:55,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6567 transitions. [2018-09-10 12:17:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-10 12:17:55,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:55,716 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:17:55,716 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -463596846, now seen corresponding path program 1 times [2018-09-10 12:17:55,717 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:55,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:55,718 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:55,996 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:17:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:56,398 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:56,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:56,398 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:56,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:56,399 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:56,399 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:56,400 INFO L87 Difference]: Start difference. First operand 4515 states and 6567 transitions. Second operand 6 states. [2018-09-10 12:17:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:59,879 INFO L93 Difference]: Finished difference Result 9747 states and 14265 transitions. [2018-09-10 12:17:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:59,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-09-10 12:17:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:59,908 INFO L225 Difference]: With dead ends: 9747 [2018-09-10 12:17:59,908 INFO L226 Difference]: Without dead ends: 5238 [2018-09-10 12:17:59,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2018-09-10 12:18:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5224. [2018-09-10 12:18:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-09-10 12:18:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 6941 transitions. [2018-09-10 12:18:00,061 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 6941 transitions. Word has length 132 [2018-09-10 12:18:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:00,062 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 6941 transitions. [2018-09-10 12:18:00,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:18:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 6941 transitions. [2018-09-10 12:18:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-10 12:18:00,064 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:00,064 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:00,064 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1815191014, now seen corresponding path program 1 times [2018-09-10 12:18:00,065 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:00,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:00,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:00,068 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 12:18:00,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:00,229 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:00,245 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:00,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:00,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:00,720 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:00,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-09-10 12:18:00,720 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:00,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:00,721 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:00,721 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:18:00,722 INFO L87 Difference]: Start difference. First operand 5224 states and 6941 transitions. Second operand 3 states. [2018-09-10 12:18:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:04,022 INFO L93 Difference]: Finished difference Result 13145 states and 17750 transitions. [2018-09-10 12:18:04,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:04,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-09-10 12:18:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:04,081 INFO L225 Difference]: With dead ends: 13145 [2018-09-10 12:18:04,082 INFO L226 Difference]: Without dead ends: 7927 [2018-09-10 12:18:04,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:18:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2018-09-10 12:18:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 7927. [2018-09-10 12:18:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7927 states. [2018-09-10 12:18:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7927 states to 7927 states and 10091 transitions. [2018-09-10 12:18:04,316 INFO L78 Accepts]: Start accepts. Automaton has 7927 states and 10091 transitions. Word has length 138 [2018-09-10 12:18:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:04,317 INFO L480 AbstractCegarLoop]: Abstraction has 7927 states and 10091 transitions. [2018-09-10 12:18:04,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10091 transitions. [2018-09-10 12:18:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-09-10 12:18:04,330 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:04,330 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:04,331 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2080042427, now seen corresponding path program 1 times [2018-09-10 12:18:04,331 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:04,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:04,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:04,333 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:04,696 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 12:18:04,930 WARN L175 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-10 12:18:05,396 WARN L175 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-09-10 12:18:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 221 proven. 115 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-10 12:18:05,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:05,972 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 12:18:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:05,980 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:06,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:06,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:06,741 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:06,742 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:06,759 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:07,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:07,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:07,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:07,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 20 [2018-09-10 12:18:07,662 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:07,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 12:18:07,663 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 12:18:07,663 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:18:07,664 INFO L87 Difference]: Start difference. First operand 7927 states and 10091 transitions. Second operand 13 states. [2018-09-10 12:18:08,312 WARN L175 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-09-10 12:18:16,729 WARN L175 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-09-10 12:18:19,037 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-09-10 12:18:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:21,131 INFO L93 Difference]: Finished difference Result 21678 states and 28214 transitions. [2018-09-10 12:18:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-10 12:18:21,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 393 [2018-09-10 12:18:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:21,215 INFO L225 Difference]: With dead ends: 21678 [2018-09-10 12:18:21,215 INFO L226 Difference]: Without dead ends: 13757 [2018-09-10 12:18:21,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1640 GetRequests, 1589 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=597, Invalid=1953, Unknown=0, NotChecked=0, Total=2550 [2018-09-10 12:18:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13757 states. [2018-09-10 12:18:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13757 to 13338. [2018-09-10 12:18:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13338 states. [2018-09-10 12:18:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13338 states to 13338 states and 16218 transitions. [2018-09-10 12:18:21,590 INFO L78 Accepts]: Start accepts. Automaton has 13338 states and 16218 transitions. Word has length 393 [2018-09-10 12:18:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:21,592 INFO L480 AbstractCegarLoop]: Abstraction has 13338 states and 16218 transitions. [2018-09-10 12:18:21,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 12:18:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 13338 states and 16218 transitions. [2018-09-10 12:18:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-09-10 12:18:21,644 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:21,644 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:21,645 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -210158269, now seen corresponding path program 1 times [2018-09-10 12:18:21,645 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:21,647 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 353 proven. 115 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-09-10 12:18:22,388 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:22,388 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 12:18:22,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:22,399 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:22,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 632 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-09-10 12:18:23,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 353 proven. 115 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-09-10 12:18:23,429 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:23,429 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 12:18:23,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:23,446 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:23,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 632 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-09-10 12:18:24,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 353 proven. 115 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-09-10 12:18:25,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:25,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:18:25,071 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:25,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:25,073 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:25,074 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:18:25,074 INFO L87 Difference]: Start difference. First operand 13338 states and 16218 transitions. Second operand 9 states. [2018-09-10 12:18:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:30,827 INFO L93 Difference]: Finished difference Result 28357 states and 35040 transitions. [2018-09-10 12:18:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:18:30,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 625 [2018-09-10 12:18:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:30,893 INFO L225 Difference]: With dead ends: 28357 [2018-09-10 12:18:30,894 INFO L226 Difference]: Without dead ends: 15044 [2018-09-10 12:18:30,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2516 GetRequests, 2496 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-09-10 12:18:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15044 states. [2018-09-10 12:18:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15044 to 15026. [2018-09-10 12:18:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15026 states. [2018-09-10 12:18:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15026 states to 15026 states and 17992 transitions. [2018-09-10 12:18:31,230 INFO L78 Accepts]: Start accepts. Automaton has 15026 states and 17992 transitions. Word has length 625 [2018-09-10 12:18:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:31,231 INFO L480 AbstractCegarLoop]: Abstraction has 15026 states and 17992 transitions. [2018-09-10 12:18:31,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 15026 states and 17992 transitions. [2018-09-10 12:18:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2018-09-10 12:18:31,274 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:31,274 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:31,275 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1447475032, now seen corresponding path program 1 times [2018-09-10 12:18:31,275 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:31,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:31,278 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:32,466 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:32,466 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:32,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:32,481 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:32,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:33,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:33,672 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:33,673 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:33,696 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:34,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:34,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:34,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:34,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:18:34,956 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:34,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:34,958 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:34,958 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:18:34,958 INFO L87 Difference]: Start difference. First operand 15026 states and 17992 transitions. Second operand 9 states. [2018-09-10 12:18:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:42,807 INFO L93 Difference]: Finished difference Result 31029 states and 38398 transitions. [2018-09-10 12:18:42,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-10 12:18:42,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 626 [2018-09-10 12:18:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:42,878 INFO L225 Difference]: With dead ends: 31029 [2018-09-10 12:18:42,878 INFO L226 Difference]: Without dead ends: 16028 [2018-09-10 12:18:42,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2532 GetRequests, 2506 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-09-10 12:18:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16028 states. [2018-09-10 12:18:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16028 to 15738. [2018-09-10 12:18:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15738 states. [2018-09-10 12:18:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15738 states to 15738 states and 18046 transitions. [2018-09-10 12:18:43,342 INFO L78 Accepts]: Start accepts. Automaton has 15738 states and 18046 transitions. Word has length 626 [2018-09-10 12:18:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:43,343 INFO L480 AbstractCegarLoop]: Abstraction has 15738 states and 18046 transitions. [2018-09-10 12:18:43,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 15738 states and 18046 transitions. [2018-09-10 12:18:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-09-10 12:18:43,555 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:43,556 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:43,556 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 748392700, now seen corresponding path program 1 times [2018-09-10 12:18:43,557 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:43,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:43,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:43,559 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:44,056 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:18:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 460 proven. 262 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 12:18:45,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:45,320 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:45,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:45,331 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:45,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-09-10 12:18:45,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-09-10 12:18:46,022 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:46,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-10 12:18:46,023 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:46,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:46,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:46,024 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:46,024 INFO L87 Difference]: Start difference. First operand 15738 states and 18046 transitions. Second operand 3 states. [2018-09-10 12:18:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:48,005 INFO L93 Difference]: Finished difference Result 30775 states and 35314 transitions. [2018-09-10 12:18:48,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:48,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 654 [2018-09-10 12:18:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:48,039 INFO L225 Difference]: With dead ends: 30775 [2018-09-10 12:18:48,039 INFO L226 Difference]: Without dead ends: 15738 [2018-09-10 12:18:48,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1321 GetRequests, 1309 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15738 states. [2018-09-10 12:18:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15738 to 15726. [2018-09-10 12:18:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15726 states. [2018-09-10 12:18:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15726 states to 15726 states and 17505 transitions. [2018-09-10 12:18:48,304 INFO L78 Accepts]: Start accepts. Automaton has 15726 states and 17505 transitions. Word has length 654 [2018-09-10 12:18:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:48,305 INFO L480 AbstractCegarLoop]: Abstraction has 15726 states and 17505 transitions. [2018-09-10 12:18:48,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 15726 states and 17505 transitions. [2018-09-10 12:18:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2018-09-10 12:18:48,346 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:48,347 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:18:48,347 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -414900739, now seen corresponding path program 1 times [2018-09-10 12:18:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:48,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:48,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:48,349 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 921 proven. 156 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-09-10 12:18:49,695 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:49,695 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:49,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:49,704 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:49,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 711 proven. 2 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-09-10 12:18:50,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 711 proven. 2 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-09-10 12:18:51,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:51,004 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 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:51,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:51,021 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:51,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 921 proven. 6 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-09-10 12:18:52,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 923 proven. 4 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-09-10 12:18:52,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:52,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:18:52,759 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:52,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:52,760 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:52,760 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:18:52,761 INFO L87 Difference]: Start difference. First operand 15726 states and 17505 transitions. Second operand 9 states. [2018-09-10 12:18:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:57,824 INFO L93 Difference]: Finished difference Result 34920 states and 39252 transitions. [2018-09-10 12:18:57,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-10 12:18:57,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 833 [2018-09-10 12:18:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:57,877 INFO L225 Difference]: With dead ends: 34920 [2018-09-10 12:18:57,877 INFO L226 Difference]: Without dead ends: 15069 [2018-09-10 12:18:57,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3354 GetRequests, 3333 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:18:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15069 states. [2018-09-10 12:18:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15069 to 14574. [2018-09-10 12:18:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14574 states. [2018-09-10 12:18:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14574 states to 14574 states and 15314 transitions. [2018-09-10 12:18:58,186 INFO L78 Accepts]: Start accepts. Automaton has 14574 states and 15314 transitions. Word has length 833 [2018-09-10 12:18:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:58,188 INFO L480 AbstractCegarLoop]: Abstraction has 14574 states and 15314 transitions. [2018-09-10 12:18:58,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14574 states and 15314 transitions. [2018-09-10 12:18:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-09-10 12:18:58,230 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:58,231 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:18:58,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1890621847, now seen corresponding path program 1 times [2018-09-10 12:18:58,232 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:58,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:58,234 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 2480 trivial. 0 not checked. [2018-09-10 12:18:59,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:18:59,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:18:59,692 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:59,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:18:59,693 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:18:59,693 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:18:59,694 INFO L87 Difference]: Start difference. First operand 14574 states and 15314 transitions. Second operand 4 states. [2018-09-10 12:19:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:02,527 INFO L93 Difference]: Finished difference Result 50216 states and 53052 transitions. [2018-09-10 12:19:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:19:02,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1131 [2018-09-10 12:19:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:02,637 INFO L225 Difference]: With dead ends: 50216 [2018-09-10 12:19:02,638 INFO L226 Difference]: Without dead ends: 33644 [2018-09-10 12:19:02,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:19:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33644 states. [2018-09-10 12:19:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33644 to 30512. [2018-09-10 12:19:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30512 states. [2018-09-10 12:19:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30512 states to 30512 states and 31945 transitions. [2018-09-10 12:19:03,247 INFO L78 Accepts]: Start accepts. Automaton has 30512 states and 31945 transitions. Word has length 1131 [2018-09-10 12:19:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:03,248 INFO L480 AbstractCegarLoop]: Abstraction has 30512 states and 31945 transitions. [2018-09-10 12:19:03,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:19:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30512 states and 31945 transitions. [2018-09-10 12:19:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1368 [2018-09-10 12:19:03,345 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:19:03,346 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:19:03,346 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:19:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1972605237, now seen corresponding path program 1 times [2018-09-10 12:19:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:19:03,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:03,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:03,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:03,348 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 787 proven. 575 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-09-10 12:19:07,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:07,289 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:19:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:07,299 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:07,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 3024 trivial. 0 not checked. [2018-09-10 12:19:08,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 3024 trivial. 0 not checked. [2018-09-10 12:19:09,430 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:19:09,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-09-10 12:19:09,431 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:19:09,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:19:09,432 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:19:09,432 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:19:09,432 INFO L87 Difference]: Start difference. First operand 30512 states and 31945 transitions. Second operand 3 states. [2018-09-10 12:19:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:11,147 INFO L93 Difference]: Finished difference Result 57981 states and 60740 transitions. [2018-09-10 12:19:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:19:11,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1367 [2018-09-10 12:19:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:11,150 INFO L225 Difference]: With dead ends: 57981 [2018-09-10 12:19:11,151 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:19:11,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2743 GetRequests, 2732 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:19:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:19:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:19:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:19:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:19:11,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1367 [2018-09-10 12:19:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:11,265 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:19:11,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:19:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:19:11,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:19:11,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:19:11,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:11,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:12,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:12,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:12,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:12,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:12,550 WARN L175 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 395 DAG size of output: 333 [2018-09-10 12:19:13,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:13,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:14,134 WARN L175 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 333 [2018-09-10 12:19:14,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:14,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:14,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:19:14,529 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-09-10 12:19:17,636 WARN L175 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 326 DAG size of output: 66 [2018-09-10 12:19:22,920 WARN L175 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 337 DAG size of output: 92 [2018-09-10 12:19:25,948 WARN L175 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 326 DAG size of output: 66 [2018-09-10 12:19:28,299 WARN L175 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 276 DAG size of output: 69 [2018-09-10 12:19:31,233 WARN L175 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 341 DAG size of output: 72 [2018-09-10 12:19:31,237 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:19:31,237 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) [2018-09-10 12:19:31,237 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:19:31,237 INFO L426 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,237 INFO L426 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,237 INFO L426 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,237 INFO L426 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:19:31,238 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:19:31,239 INFO L422 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse3 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse14 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse15 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse16 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse4 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (let ((.cse5 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse17 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse13 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse21 (not .cse4)) (.cse2 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse18 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 7)) (.cse19 (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4)) .cse14 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7)) .cse15 .cse16 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (.cse10 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79))) (.cse6 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse12 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 79) 0)) (.cse7 (and .cse14 .cse15 .cse16)) (.cse9 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse11 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 135)) (.cse1 (<= 135 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)) (.cse8 (not .cse3)) (.cse20 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8) (or .cse7 (or .cse9 .cse3 .cse5)) (or .cse10 .cse2 .cse3 .cse4 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse1) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse5) (or .cse13 .cse2 .cse10 .cse12) (or (and .cse10 .cse14 .cse15 .cse16) .cse2 .cse3 .cse12 .cse5) (or .cse7 .cse2 .cse17) (or .cse7 .cse2 .cse18 .cse3 .cse5) (or .cse19 .cse2 .cse8 .cse20) (or .cse0 .cse9 .cse1 .cse3 .cse4 .cse11) (or .cse21 .cse8 .cse7) (or .cse6 .cse0 .cse1 .cse8 .cse17) (or .cse13 .cse2 .cse3 .cse7) (or (or .cse10 (not (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 3))) (or (not (= 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) .cse21 (not (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)))) (or .cse2 .cse18 .cse8 .cse4 (and .cse10 .cse19) .cse12) (or .cse10 (or .cse6 .cse8 .cse11 .cse12)) (or .cse7 .cse9 .cse4 .cse11) (or .cse0 .cse1 .cse8 .cse20)))) [2018-09-10 12:19:31,239 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,239 INFO L426 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2018-09-10 12:19:31,239 INFO L426 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,239 INFO L426 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,240 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,241 INFO L426 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,242 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,243 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,244 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,245 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:19:31,246 INFO L426 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,247 INFO L426 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,248 INFO L426 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:19:31,249 INFO L426 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,250 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:19:31,251 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,252 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,253 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,254 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,255 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,256 INFO L426 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,257 INFO L426 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,258 INFO L426 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,259 INFO L426 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,260 INFO L426 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:19:31,261 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,262 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,263 INFO L426 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:19:31,264 INFO L426 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,265 INFO L426 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,266 INFO L426 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:19:31,267 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,268 INFO L426 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,269 INFO L426 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,270 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 124) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:19:31,270 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:19:31,271 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:19:31,271 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:19:31,271 INFO L426 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,271 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse3 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (let ((.cse10 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 9)) (.cse0 (<= 135 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)) (.cse1 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 135)) (.cse12 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse8 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse15 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse7 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse6 (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (.cse2 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse4 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse14 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79))) (.cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse9 (not .cse3)) (.cse5 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse13 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 79) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (not .cse4) .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse10 .cse0) (or .cse11 .cse2 .cse6 .cse8) (or .cse6 .cse12 .cse7 .cse3) (or .cse6 .cse7 .cse10 .cse8) (or .cse1 .cse2 .cse0 .cse7 .cse3 .cse8) (or .cse12 .cse7 .cse13 .cse14) (or .cse14 .cse7 .cse3 .cse13 .cse8) (or .cse11 .cse1 .cse0 .cse9 .cse15) (or .cse14 .cse7 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 7) .cse4 .cse13 .cse8) (or .cse1 .cse7 .cse3 .cse4 .cse8 .cse0) (or .cse0 .cse1 .cse12 .cse7) (or .cse6 .cse7 .cse13 .cse8) (or .cse7 .cse6 .cse15) (or .cse7 .cse3 .cse4 .cse14 .cse5 .cse13) (or .cse6 .cse2 .cse4 .cse5) (or .cse14 (or .cse11 .cse9 .cse5 .cse13))))) [2018-09-10 12:19:31,271 INFO L426 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,271 INFO L426 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-09-10 12:19:31,272 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:19:31,272 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) [2018-09-10 12:19:31,272 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:19:31,272 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:19:31,272 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) [2018-09-10 12:19:31,272 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:19:31,272 INFO L422 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7))) (.cse10 (not .cse6))) (let ((.cse9 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4))) (.cse11 (and .cse0 .cse5 .cse10))) (let ((.cse4 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse3 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse8 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79))) (.cse1 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse7 (and .cse9 .cse11))) (or (and .cse0 .cse1 .cse2 .cse3) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (and (<= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) .cse4 .cse0 .cse1 .cse2) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7) .cse1 .cse5 .cse2) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (and .cse1 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) .cse6) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (and (and .cse7 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) .cse1) (and .cse8 .cse1 .cse6) (and (and .cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) .cse1) (and .cse9 .cse4 .cse1 .cse10) (and .cse1 (and .cse3 (and .cse9 .cse0))) (and (and .cse11 .cse2) .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse8 .cse1 .cse7) (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)))))) [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1773-1(lines 1773 1782) no Hoare annotation was computed. [2018-09-10 12:19:31,273 INFO L422 ceAbstractionStarter]: At program point L1773-3(lines 1773 1782) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7))) (.cse10 (not .cse6))) (let ((.cse9 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4))) (.cse11 (and .cse0 .cse5 .cse10))) (let ((.cse4 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse3 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse8 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79))) (.cse1 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse7 (and .cse9 .cse11))) (or (and .cse0 .cse1 .cse2 .cse3) (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (and (<= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) .cse4 .cse0 .cse1 .cse2) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7) .cse1 .cse5 .cse2) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (and .cse1 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) .cse6) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (and (and .cse7 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) .cse1) (and .cse8 .cse1 .cse6) (and (and .cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) .cse1) (and .cse9 .cse4 .cse1 .cse10) (and .cse1 (and .cse3 (and .cse9 .cse0))) (and (and .cse11 .cse2) .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse8 .cse1 .cse7) (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)))))) [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1773-4(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,273 INFO L426 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L426 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L426 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L426 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L426 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L426 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,274 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse7 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse15 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse10 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 9)) (.cse6 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse13 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse5 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 135)) (.cse3 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse4 (<= 135 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)) (.cse1 (and .cse15 .cse16 .cse17)) (.cse18 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse2 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse0 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse12 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79))) (.cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse9 (not .cse7)) (.cse8 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse14 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 79) 0))) (and (or (not .cse0) .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse0 .cse8) (or .cse5 .cse9 .cse10 .cse4) (or .cse11 .cse6 .cse1 .cse3) (or .cse6 .cse0 .cse1 .cse8) (or .cse1 .cse2 .cse10 .cse3) (or .cse12 (or .cse13 .cse2) .cse14) (or .cse5 .cse13 .cse2 .cse4) (or .cse5 .cse6 .cse4 .cse2 .cse7 .cse3) (or (and .cse12 .cse15 .cse16 .cse17) .cse2 .cse7 .cse14 .cse3) (or .cse9 .cse1 .cse14) (or (or .cse2 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 7) .cse9 .cse0) .cse12 .cse14) (or .cse13 .cse2 .cse7 .cse1) (or .cse11 .cse5 .cse4 .cse9 .cse18) (or .cse5 .cse2 .cse7 .cse0 .cse3 .cse4) (or .cse2 .cse1 .cse18) (or .cse2 .cse7 .cse0 .cse12 .cse8 .cse14) (or .cse12 (or .cse11 .cse9 .cse8 .cse14))))) [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,275 INFO L426 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:19:31,276 INFO L426 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,277 INFO L426 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,278 INFO L426 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-09-10 12:19:31,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:19:31 BoogieIcfgContainer [2018-09-10 12:19:31,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:19:31,315 INFO L168 Benchmark]: Toolchain (without parser) took 126187.47 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 12:19:31,318 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:19:31,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1291.21 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 12:19:31,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 209.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:31,320 INFO L168 Benchmark]: Boogie Preprocessor took 473.41 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -982.3 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:31,321 INFO L168 Benchmark]: RCFGBuilder took 6097.48 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 278.6 MB). Peak memory consumption was 278.6 MB. Max. memory is 7.1 GB. [2018-09-10 12:19:31,322 INFO L168 Benchmark]: TraceAbstraction took 118106.06 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -461.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-10 12:19:31,328 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1291.21 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 209.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 473.41 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -982.3 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6097.48 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 278.6 MB). Peak memory consumption was 278.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118106.06 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -461.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1773]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) || 12 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || ((((4 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10)) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 7 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12))) || 5 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12)) || ((9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) || 4 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || ((0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 79 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 5) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8))) || (9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10))) || (((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15)) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12)) || ((0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 79 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8))) || 8 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. SAFE Result, 117.9s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 66.8s AutomataDifference, 0.0s DeadEndRemovalTime, 19.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2939 SDtfs, 21113 SDslu, 1720 SDs, 0 SdLazy, 35416 SolverSat, 9190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14438 GetRequests, 14253 SyntacticMatches, 32 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30512occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 4446 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 1280 PreInvPairs, 1978 NumberOfFragments, 1750 HoareAnnotationTreeSize, 1280 FomulaSimplifications, 215185 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 419495 FormulaSimplificationTreeSizeReductionInter, 16.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 13439 NumberOfCodeBlocks, 13439 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 20517 ConstructedInterpolants, 0 QuantifiedInterpolants, 43936724 SizeOfPredicates, 7 NumberOfNonLiveVariables, 10015 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 35 InterpolantComputations, 12 PerfectInterpolantSequences, 30146/31670 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label12_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-19-31-360.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label12_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-19-31-360.csv Received shutdown request...