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/Problem11_label09_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:33:48,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:33:48,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:33:48,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:33:48,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:33:48,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:33:48,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:33:48,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:33:48,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:33:48,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:33:48,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:33:48,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:33:48,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:33:48,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:33:48,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:33:48,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:33:48,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:33:48,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:33:48,206 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:33:48,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:33:48,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:33:48,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:33:48,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:33:48,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:33:48,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:33:48,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:33:48,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:33:48,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:33:48,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:33:48,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:33:48,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:33:48,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:33:48,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:33:48,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:33:48,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:33:48,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:33:48,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 11:33:48,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:33:48,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:33:48,249 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:33:48,249 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:33:48,250 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:33:48,250 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:33:48,250 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:33:48,250 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:33:48,250 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:33:48,251 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:33:48,251 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:33:48,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:33:48,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:33:48,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:33:48,254 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:33:48,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:33:48,254 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:33:48,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:33:48,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:33:48,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:33:48,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:33:48,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:33:48,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:33:48,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:33:48,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:33:48,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:33:48,258 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:33:48,258 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:33:48,258 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:33:48,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:33:48,258 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:33:48,259 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:33:48,259 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:33:48,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:33:48,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:33:48,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:33:48,327 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:33:48,327 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:33:48,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label09_true-unreach-call.c [2018-09-10 11:33:48,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c43cb23/a6e66b00679046b78b3c6f5b21f6174f/FLAG288968154 [2018-09-10 11:33:49,000 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:33:49,001 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label09_true-unreach-call.c [2018-09-10 11:33:49,026 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c43cb23/a6e66b00679046b78b3c6f5b21f6174f/FLAG288968154 [2018-09-10 11:33:49,050 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c43cb23/a6e66b00679046b78b3c6f5b21f6174f [2018-09-10 11:33:49,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:33:49,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:33:49,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:33:49,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:33:49,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:33:49,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:33:49" (1/1) ... [2018-09-10 11:33:49,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5049ddee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:49, skipping insertion in model container [2018-09-10 11:33:49,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:33:49" (1/1) ... [2018-09-10 11:33:49,304 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:33:49,722 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:33:49,743 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:33:49,969 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:33:50,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50 WrapperNode [2018-09-10 11:33:50,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:33:50,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:33:50,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:33:50,042 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:33:50,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:33:50,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:33:50,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:33:50,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:33:50,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... [2018-09-10 11:33:50,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:33:50,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:33:50,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:33:50,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:33:50,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:33:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:33:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:33:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:33:50,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:33:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:33:50,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:33:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:33:50,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:33:55,952 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:33:55,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:33:55 BoogieIcfgContainer [2018-09-10 11:33:55,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:33:55,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:33:55,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:33:55,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:33:55,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:33:49" (1/3) ... [2018-09-10 11:33:55,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aedba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:33:55, skipping insertion in model container [2018-09-10 11:33:55,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:33:50" (2/3) ... [2018-09-10 11:33:55,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aedba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:33:55, skipping insertion in model container [2018-09-10 11:33:55,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:33:55" (3/3) ... [2018-09-10 11:33:55,961 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label09_true-unreach-call.c [2018-09-10 11:33:55,970 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:33:55,978 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:33:56,035 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:33:56,036 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:33:56,037 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:33:56,037 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:33:56,037 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:33:56,037 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:33:56,039 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:33:56,039 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:33:56,039 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:33:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-10 11:33:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-10 11:33:56,106 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:33:56,107 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:33:56,108 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:33:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash -662645095, now seen corresponding path program 1 times [2018-09-10 11:33:56,119 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:33:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:56,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:33:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:33:56,187 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:33:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:33:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:33:56,729 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:33:56,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:33:56,730 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:33:56,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:33:56,752 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:33:56,752 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:33:56,755 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-09-10 11:34:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:02,523 INFO L93 Difference]: Finished difference Result 1001 states and 1780 transitions. [2018-09-10 11:34:02,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:34:02,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-09-10 11:34:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:02,548 INFO L225 Difference]: With dead ends: 1001 [2018-09-10 11:34:02,548 INFO L226 Difference]: Without dead ends: 702 [2018-09-10 11:34:02,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:34:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-09-10 11:34:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2018-09-10 11:34:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-09-10 11:34:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1082 transitions. [2018-09-10 11:34:02,678 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1082 transitions. Word has length 73 [2018-09-10 11:34:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:02,679 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 1082 transitions. [2018-09-10 11:34:02,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:34:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1082 transitions. [2018-09-10 11:34:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-10 11:34:02,689 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:02,689 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:34:02,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash 888109835, now seen corresponding path program 1 times [2018-09-10 11:34:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:02,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:02,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:02,692 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:03,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:34:03,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:34:03,054 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:03,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:34:03,057 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:34:03,057 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:34:03,058 INFO L87 Difference]: Start difference. First operand 699 states and 1082 transitions. Second operand 6 states. [2018-09-10 11:34:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:08,674 INFO L93 Difference]: Finished difference Result 2534 states and 4100 transitions. [2018-09-10 11:34:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:34:08,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-09-10 11:34:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:08,696 INFO L225 Difference]: With dead ends: 2534 [2018-09-10 11:34:08,697 INFO L226 Difference]: Without dead ends: 1841 [2018-09-10 11:34:08,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:34:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2018-09-10 11:34:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1815. [2018-09-10 11:34:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2018-09-10 11:34:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2683 transitions. [2018-09-10 11:34:08,774 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2683 transitions. Word has length 146 [2018-09-10 11:34:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:08,775 INFO L480 AbstractCegarLoop]: Abstraction has 1815 states and 2683 transitions. [2018-09-10 11:34:08,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:34:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2683 transitions. [2018-09-10 11:34:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-10 11:34:08,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:08,781 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:34:08,781 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1093992180, now seen corresponding path program 1 times [2018-09-10 11:34:08,782 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:08,783 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:09,251 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:34:09,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-10 11:34:09,251 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:09,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 11:34:09,252 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 11:34:09,252 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-10 11:34:09,252 INFO L87 Difference]: Start difference. First operand 1815 states and 2683 transitions. Second operand 7 states. [2018-09-10 11:34:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:17,404 INFO L93 Difference]: Finished difference Result 5584 states and 8648 transitions. [2018-09-10 11:34:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-10 11:34:17,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2018-09-10 11:34:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:17,433 INFO L225 Difference]: With dead ends: 5584 [2018-09-10 11:34:17,433 INFO L226 Difference]: Without dead ends: 3775 [2018-09-10 11:34:17,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-10 11:34:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2018-09-10 11:34:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 3460. [2018-09-10 11:34:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2018-09-10 11:34:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4692 transitions. [2018-09-10 11:34:17,578 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4692 transitions. Word has length 147 [2018-09-10 11:34:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:17,579 INFO L480 AbstractCegarLoop]: Abstraction has 3460 states and 4692 transitions. [2018-09-10 11:34:17,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 11:34:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4692 transitions. [2018-09-10 11:34:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-10 11:34:17,584 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:17,584 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:34:17,585 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2030972197, now seen corresponding path program 1 times [2018-09-10 11:34:17,585 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:17,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:17,587 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 11:34:18,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:34:18,125 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:34:18,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:18,138 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:34:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:18,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:34:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 11:34:18,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:34:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 11:34:18,740 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:34:18,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2018-09-10 11:34:18,740 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:18,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:34:18,741 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:34:18,741 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 11:34:18,742 INFO L87 Difference]: Start difference. First operand 3460 states and 4692 transitions. Second operand 4 states. [2018-09-10 11:34:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:20,781 INFO L93 Difference]: Finished difference Result 8369 states and 12007 transitions. [2018-09-10 11:34:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:34:20,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-09-10 11:34:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:20,808 INFO L225 Difference]: With dead ends: 8369 [2018-09-10 11:34:20,809 INFO L226 Difference]: Without dead ends: 4915 [2018-09-10 11:34:20,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 11:34:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2018-09-10 11:34:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4530. [2018-09-10 11:34:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4530 states. [2018-09-10 11:34:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 6357 transitions. [2018-09-10 11:34:20,935 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 6357 transitions. Word has length 200 [2018-09-10 11:34:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:20,935 INFO L480 AbstractCegarLoop]: Abstraction has 4530 states and 6357 transitions. [2018-09-10 11:34:20,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:34:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 6357 transitions. [2018-09-10 11:34:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-10 11:34:20,940 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:20,941 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:34:20,941 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2008994851, now seen corresponding path program 1 times [2018-09-10 11:34:20,941 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:20,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:20,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:20,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:20,943 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:21,805 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:34:21,806 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:34:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:21,821 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:34:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:21,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:34:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:22,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:34:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:22,608 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 11:34:22,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-10 11:34:22,608 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:22,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:34:22,609 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:34:22,609 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:34:22,610 INFO L87 Difference]: Start difference. First operand 4530 states and 6357 transitions. Second operand 3 states. [2018-09-10 11:34:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:24,675 INFO L93 Difference]: Finished difference Result 10620 states and 15449 transitions. [2018-09-10 11:34:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:34:24,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-09-10 11:34:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:24,716 INFO L225 Difference]: With dead ends: 10620 [2018-09-10 11:34:24,716 INFO L226 Difference]: Without dead ends: 6096 [2018-09-10 11:34:24,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:34:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2018-09-10 11:34:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 5902. [2018-09-10 11:34:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2018-09-10 11:34:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 8204 transitions. [2018-09-10 11:34:24,949 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 8204 transitions. Word has length 205 [2018-09-10 11:34:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:24,950 INFO L480 AbstractCegarLoop]: Abstraction has 5902 states and 8204 transitions. [2018-09-10 11:34:24,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:34:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 8204 transitions. [2018-09-10 11:34:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-10 11:34:24,963 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:24,964 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 11:34:24,964 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:24,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1530098488, now seen corresponding path program 1 times [2018-09-10 11:34:24,964 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:24,966 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 11:34:25,536 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:34:25,537 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:34:25,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:25,544 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:34:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:25,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:34:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:25,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:34:26,302 WARN L175 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 11:34:26,518 WARN L175 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 11:34:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:26,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:34:26,865 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:34:26,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:26,884 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:34:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:27,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:34:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:27,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:34:27,364 WARN L175 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 11:34:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:34:27,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:34:27,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 14 [2018-09-10 11:34:27,653 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:34:27,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-10 11:34:27,654 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-10 11:34:27,654 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-10 11:34:27,657 INFO L87 Difference]: Start difference. First operand 5902 states and 8204 transitions. Second operand 12 states. [2018-09-10 11:34:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:51,384 INFO L93 Difference]: Finished difference Result 27706 states and 50074 transitions. [2018-09-10 11:34:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-10 11:34:51,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 287 [2018-09-10 11:34:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:51,559 INFO L225 Difference]: With dead ends: 27706 [2018-09-10 11:34:51,559 INFO L226 Difference]: Without dead ends: 21810 [2018-09-10 11:34:51,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1260 GetRequests, 1186 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=829, Invalid=4871, Unknown=0, NotChecked=0, Total=5700 [2018-09-10 11:34:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21810 states. [2018-09-10 11:34:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21810 to 20488. [2018-09-10 11:34:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20488 states. [2018-09-10 11:34:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20488 states to 20488 states and 27575 transitions. [2018-09-10 11:34:52,370 INFO L78 Accepts]: Start accepts. Automaton has 20488 states and 27575 transitions. Word has length 287 [2018-09-10 11:34:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:52,370 INFO L480 AbstractCegarLoop]: Abstraction has 20488 states and 27575 transitions. [2018-09-10 11:34:52,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-10 11:34:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20488 states and 27575 transitions. [2018-09-10 11:34:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-10 11:34:52,391 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:52,392 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:34:52,392 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1698866549, now seen corresponding path program 1 times [2018-09-10 11:34:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:52,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:52,394 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 11:34:52,745 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:34:52,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:34:52,745 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:52,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:34:52,746 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:34:52,746 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:34:52,747 INFO L87 Difference]: Start difference. First operand 20488 states and 27575 transitions. Second operand 4 states. [2018-09-10 11:34:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:55,952 INFO L93 Difference]: Finished difference Result 47503 states and 67022 transitions. [2018-09-10 11:34:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:34:55,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2018-09-10 11:34:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:56,047 INFO L225 Difference]: With dead ends: 47503 [2018-09-10 11:34:56,047 INFO L226 Difference]: Without dead ends: 27026 [2018-09-10 11:34:56,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:34:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27026 states. [2018-09-10 11:34:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27026 to 26376. [2018-09-10 11:34:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26376 states. [2018-09-10 11:34:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26376 states to 26376 states and 35731 transitions. [2018-09-10 11:34:56,717 INFO L78 Accepts]: Start accepts. Automaton has 26376 states and 35731 transitions. Word has length 295 [2018-09-10 11:34:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:34:56,718 INFO L480 AbstractCegarLoop]: Abstraction has 26376 states and 35731 transitions. [2018-09-10 11:34:56,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:34:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 26376 states and 35731 transitions. [2018-09-10 11:34:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-09-10 11:34:56,778 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:34:56,779 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:34:56,779 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:34:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash 37112919, now seen corresponding path program 1 times [2018-09-10 11:34:56,780 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:34:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:56,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:34:56,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:34:56,781 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:34:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:34:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-09-10 11:34:57,399 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:34:57,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:34:57,399 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:34:57,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:34:57,400 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:34:57,400 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:34:57,401 INFO L87 Difference]: Start difference. First operand 26376 states and 35731 transitions. Second operand 3 states. [2018-09-10 11:34:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:34:59,283 INFO L93 Difference]: Finished difference Result 58580 states and 82321 transitions. [2018-09-10 11:34:59,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:34:59,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2018-09-10 11:34:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:34:59,411 INFO L225 Difference]: With dead ends: 58580 [2018-09-10 11:34:59,411 INFO L226 Difference]: Without dead ends: 32590 [2018-09-10 11:34:59,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:34:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32590 states. [2018-09-10 11:35:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32590 to 31980. [2018-09-10 11:35:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31980 states. [2018-09-10 11:35:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31980 states to 31980 states and 42207 transitions. [2018-09-10 11:35:00,093 INFO L78 Accepts]: Start accepts. Automaton has 31980 states and 42207 transitions. Word has length 366 [2018-09-10 11:35:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:35:00,094 INFO L480 AbstractCegarLoop]: Abstraction has 31980 states and 42207 transitions. [2018-09-10 11:35:00,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:35:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31980 states and 42207 transitions. [2018-09-10 11:35:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-10 11:35:00,149 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:35:00,149 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:35:00,150 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 11:35:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1224606404, now seen corresponding path program 1 times [2018-09-10 11:35:00,150 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:35:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:00,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:00,151 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:35:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 198 proven. 4 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-10 11:35:00,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:35:00,363 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:35:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:00,379 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:35:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:00,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:35:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-09-10 11:35:00,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:35:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 198 proven. 4 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-10 11:35:00,912 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:35:00,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-09-10 11:35:00,912 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:35:00,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:35:00,913 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:35:00,913 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:35:00,913 INFO L87 Difference]: Start difference. First operand 31980 states and 42207 transitions. Second operand 3 states. [2018-09-10 11:35:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:35:02,188 INFO L93 Difference]: Finished difference Result 57535 states and 76084 transitions. [2018-09-10 11:35:02,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:35:02,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2018-09-10 11:35:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:35:02,264 INFO L225 Difference]: With dead ends: 57535 [2018-09-10 11:35:02,264 INFO L226 Difference]: Without dead ends: 25015 [2018-09-10 11:35:02,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 735 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:35:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25015 states. [2018-09-10 11:35:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25015 to 24959. [2018-09-10 11:35:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24959 states. [2018-09-10 11:35:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24959 states to 24959 states and 30861 transitions. [2018-09-10 11:35:02,743 INFO L78 Accepts]: Start accepts. Automaton has 24959 states and 30861 transitions. Word has length 368 [2018-09-10 11:35:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:35:02,744 INFO L480 AbstractCegarLoop]: Abstraction has 24959 states and 30861 transitions. [2018-09-10 11:35:02,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:35:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24959 states and 30861 transitions. [2018-09-10 11:35:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-09-10 11:35:02,812 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:35:02,813 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:35:02,813 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 11:35:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1768182149, now seen corresponding path program 1 times [2018-09-10 11:35:02,814 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:35:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:02,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:02,815 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:35:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 280 proven. 2 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-09-10 11:35:03,227 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:35:03,227 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 11:35:03,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:03,234 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:35:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:03,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:35:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-09-10 11:35:03,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:35:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 280 proven. 2 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-09-10 11:35:03,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:35:03,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-09-10 11:35:03,990 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:35:03,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:35:03,991 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:35:03,991 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:35:03,991 INFO L87 Difference]: Start difference. First operand 24959 states and 30861 transitions. Second operand 3 states. [2018-09-10 11:35:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:35:05,523 INFO L93 Difference]: Finished difference Result 50735 states and 63892 transitions. [2018-09-10 11:35:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:35:05,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2018-09-10 11:35:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:35:05,602 INFO L225 Difference]: With dead ends: 50735 [2018-09-10 11:35:05,602 INFO L226 Difference]: Without dead ends: 24695 [2018-09-10 11:35:05,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:35:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24695 states. [2018-09-10 11:35:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24695 to 24489. [2018-09-10 11:35:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24489 states. [2018-09-10 11:35:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24489 states to 24489 states and 29484 transitions. [2018-09-10 11:35:06,067 INFO L78 Accepts]: Start accepts. Automaton has 24489 states and 29484 transitions. Word has length 507 [2018-09-10 11:35:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:35:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 24489 states and 29484 transitions. [2018-09-10 11:35:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:35:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24489 states and 29484 transitions. [2018-09-10 11:35:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-09-10 11:35:06,126 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:35:06,127 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, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:35:06,127 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 11:35:06,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1813271313, now seen corresponding path program 1 times [2018-09-10 11:35:06,128 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:35:06,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:06,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:06,129 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:35:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:06,848 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 11:35:07,230 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 11:35:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 513 proven. 81 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-09-10 11:35:08,099 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:35:08,099 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:35:08,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:08,109 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:35:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:08,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:35:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 682 proven. 2 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-09-10 11:35:09,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:35:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 513 proven. 81 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-09-10 11:35:10,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:35:10,009 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:35:10,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:10,024 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:35:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:10,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:35:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 682 proven. 2 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-09-10 11:35:11,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:35:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 513 proven. 81 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-09-10 11:35:11,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:35:11,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 8, 5, 5] total 24 [2018-09-10 11:35:11,806 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:35:11,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 11:35:11,808 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 11:35:11,809 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-09-10 11:35:11,809 INFO L87 Difference]: Start difference. First operand 24489 states and 29484 transitions. Second operand 15 states. [2018-09-10 11:35:12,992 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2018-09-10 11:35:13,150 WARN L175 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2018-09-10 11:35:13,549 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-09-10 11:35:14,431 WARN L175 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-09-10 11:35:14,663 WARN L175 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-09-10 11:35:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:35:19,961 INFO L93 Difference]: Finished difference Result 47228 states and 57157 transitions. [2018-09-10 11:35:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-10 11:35:19,961 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 565 [2018-09-10 11:35:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:35:20,007 INFO L225 Difference]: With dead ends: 47228 [2018-09-10 11:35:20,008 INFO L226 Difference]: Without dead ends: 22934 [2018-09-10 11:35:20,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2306 GetRequests, 2262 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-09-10 11:35:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22934 states. [2018-09-10 11:35:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22934 to 22746. [2018-09-10 11:35:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22746 states. [2018-09-10 11:35:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22746 states to 22746 states and 26576 transitions. [2018-09-10 11:35:20,406 INFO L78 Accepts]: Start accepts. Automaton has 22746 states and 26576 transitions. Word has length 565 [2018-09-10 11:35:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:35:20,407 INFO L480 AbstractCegarLoop]: Abstraction has 22746 states and 26576 transitions. [2018-09-10 11:35:20,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 11:35:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 22746 states and 26576 transitions. [2018-09-10 11:35:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-09-10 11:35:20,445 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:35:20,446 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:35:20,446 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 11:35:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1388327361, now seen corresponding path program 1 times [2018-09-10 11:35:20,446 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:35:20,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:20,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:20,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:35:20,447 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:35:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 275 proven. 404 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-09-10 11:35:21,151 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:35:21,152 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 11:35:21,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:21,160 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:35:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:21,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:35:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2018-09-10 11:35:22,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:35:22,555 WARN L175 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 11:35:22,680 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-09-10 11:35:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2018-09-10 11:35:23,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:35:23,086 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 11:35:23,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:35:23,103 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:35:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:35:23,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:35:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2018-09-10 11:35:23,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:35:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2018-09-10 11:35:24,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:35:24,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 12 [2018-09-10 11:35:24,511 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:35:24,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-10 11:35:24,513 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-10 11:35:24,513 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-10 11:35:24,513 INFO L87 Difference]: Start difference. First operand 22746 states and 26576 transitions. Second operand 10 states. [2018-09-10 11:35:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:35:34,714 INFO L93 Difference]: Finished difference Result 53173 states and 63087 transitions. [2018-09-10 11:35:34,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-10 11:35:34,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 581 [2018-09-10 11:35:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:35:34,715 INFO L225 Difference]: With dead ends: 53173 [2018-09-10 11:35:34,715 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 11:35:34,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2432 GetRequests, 2371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=658, Invalid=3248, Unknown=0, NotChecked=0, Total=3906 [2018-09-10 11:35:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 11:35:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 11:35:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 11:35:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 11:35:34,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 581 [2018-09-10 11:35:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:35:34,768 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 11:35:34,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-10 11:35:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 11:35:34,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 11:35:34,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 11:35:35,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,889 WARN L175 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 529 DAG size of output: 219 [2018-09-10 11:35:35,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:35,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:35:36,599 WARN L175 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 529 DAG size of output: 219 [2018-09-10 11:35:37,198 WARN L175 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-09-10 11:35:37,555 WARN L175 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-09-10 11:35:42,680 WARN L175 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 425 DAG size of output: 95 [2018-09-10 11:35:43,747 WARN L175 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 216 DAG size of output: 81 [2018-09-10 11:35:44,825 WARN L175 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 216 DAG size of output: 81 [2018-09-10 11:35:44,828 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:35:44,828 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|)) [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,829 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,830 INFO L426 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-09-10 11:35:44,831 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,832 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 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,832 INFO L426 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,833 INFO L426 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-09-10 11:35:44,834 INFO L426 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,835 INFO L426 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,836 INFO L426 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-09-10 11:35:44,837 INFO L426 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-09-10 11:35:44,838 INFO L426 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-09-10 11:35:44,839 INFO L426 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-09-10 11:35:44,840 INFO L426 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,841 INFO L426 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-09-10 11:35:44,842 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 204) no Hoare annotation was computed. [2018-09-10 11:35:44,842 INFO L426 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-09-10 11:35:44,843 INFO L426 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,844 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,845 INFO L426 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,846 INFO L426 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-09-10 11:35:44,847 INFO L426 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,848 INFO L426 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,849 INFO L426 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,850 INFO L426 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-09-10 11:35:44,851 INFO L426 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,852 INFO L426 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,853 INFO L426 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,854 INFO L426 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,855 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 22 1026) the Hoare annotation is: (let ((.cse0 (< 138 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|)) (.cse8 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|)) (.cse3 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| 43) 0)) (.cse27 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| 599772)) (.cse26 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|)) (.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|)) (.cse18 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|)) (.cse24 (= 13 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|))) (let ((.cse19 (not .cse24)) (.cse15 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)| 130)) (.cse6 (not (= 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|))) (.cse9 (and .cse16 .cse17 (= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) .cse18)) (.cse20 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)| 278)) (.cse11 (not (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|))) (.cse25 (< 130 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|)) (.cse14 (and .cse16 .cse26 .cse17 .cse18)) (.cse2 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1) .cse16 .cse26 .cse17)) (.cse10 (< 0 .cse27)) (.cse13 (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|))) (.cse4 (< 245 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|)) (.cse1 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|))) (.cse12 (< .cse27 0)) (.cse21 (and (and .cse16 .cse26) .cse17 .cse18)) (.cse23 (< 274 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|)) (.cse5 (not (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0))) (.cse22 (or .cse0 (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|) .cse8 .cse3)) (.cse7 (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse4 .cse1 .cse2 .cse12) (or .cse13 .cse5 .cse1 .cse14 .cse7) (or .cse15 .cse4 .cse5 .cse1 (and .cse16 .cse17 (= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) .cse18) .cse7 .cse19) (or .cse10 .cse13 .cse20 .cse2 .cse1 .cse12) (or .cse21 .cse5 .cse22 .cse7 .cse19) (or .cse11 .cse5 .cse14 .cse7 .cse8) (or .cse15 .cse23 .cse5 .cse1 .cse6 .cse7 .cse9) (or .cse24 .cse14 .cse20 .cse5 .cse1 .cse7) (or .cse0 .cse14 .cse4 .cse5 .cse7 .cse3 .cse8) (or .cse14 .cse5 .cse1 .cse7 .cse3) (or .cse24 .cse25 .cse5 .cse14 .cse7 .cse8) (or .cse14 .cse5 (or .cse24 .cse20 .cse8) .cse7) (or .cse11 .cse25 .cse14 .cse5 .cse1 .cse7) (or .cse2 .cse10 .cse13 .cse4 .cse1 .cse12) (or .cse21 .cse23 .cse5 .cse22 .cse7)))) [2018-09-10 11:35:44,855 INFO L426 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-09-10 11:35:44,855 INFO L426 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-09-10 11:35:44,855 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:35:44,856 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 130 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0 15) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1) (<= 312 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 1) (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 312)) [2018-09-10 11:35:44,856 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 11:35:44,856 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:35:44,857 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)| 130) (< 130 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|) (not (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|)) (< 312 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| 312) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 312) (<= 312 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|))) [2018-09-10 11:35:44,857 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-09-10 11:35:44,857 INFO L422 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse16 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 245)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13)))) (let ((.cse5 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43))) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 138)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 0)) (.cse11 (and .cse16 .cse3))) (let ((.cse4 (<= 278 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse10 (= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse7 (and .cse1 .cse11)) (.cse2 (= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (.cse8 (<= 130 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse13 (= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 274)) (.cse14 (and .cse1 .cse5 .cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9))))) (or (and .cse0 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (< 130 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|) (and .cse1 .cse2) (and .cse0 .cse3 .cse4) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)| 130) (< 312 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (and .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse4) (and .cse8 .cse9 .cse0 .cse10) (let ((.cse12 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 600084))) (and .cse2 .cse0 .cse11 (<= .cse12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| .cse12))) (and .cse10 .cse7) (not (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (and .cse13 .cse14) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| 312) (and .cse15 .cse2 .cse0) (and .cse5 .cse0) (and .cse1 .cse15 .cse3) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|)) (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|)) (and .cse8 .cse16 .cse0 .cse13) (and .cse9 .cse14))))) [2018-09-10 11:35:44,857 INFO L426 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-09-10 11:35:44,857 INFO L426 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-09-10 11:35:44,858 INFO L426 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-09-10 11:35:44,858 INFO L422 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse16 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 245)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13)))) (let ((.cse5 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43))) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 138)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 0)) (.cse11 (and .cse16 .cse3))) (let ((.cse4 (<= 278 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse10 (= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse7 (and .cse1 .cse11)) (.cse2 (= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (.cse8 (<= 130 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse13 (= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 274)) (.cse14 (and .cse1 .cse5 .cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9))))) (or (and .cse0 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (< 130 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)|) (and .cse1 .cse2) (and .cse0 .cse3 .cse4) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)| 130) (< 312 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (and .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse4) (and .cse8 .cse9 .cse0 .cse10) (let ((.cse12 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 600084))) (and .cse2 .cse0 .cse11 (<= .cse12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| .cse12))) (and .cse10 .cse7) (not (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (and .cse13 .cse14) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)| 312) (and .cse15 .cse2 .cse0) (and .cse5 .cse0) (and .cse1 .cse15 .cse3) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)|)) (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)|)) (and .cse8 .cse16 .cse0 .cse13) (and .cse9 .cse14))))) [2018-09-10 11:35:44,858 INFO L426 ceAbstractionStarter]: For program point L1034-4(lines 1028 1044) no Hoare annotation was computed. [2018-09-10 11:35:44,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:35:44 BoogieIcfgContainer [2018-09-10 11:35:44,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:35:44,888 INFO L168 Benchmark]: Toolchain (without parser) took 115824.26 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-10 11:35:44,889 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 11:35:44,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 971.42 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-10 11:35:44,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.27 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 11:35:44,891 INFO L168 Benchmark]: Boogie Preprocessor took 385.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 811.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -941.0 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-09-10 11:35:44,892 INFO L168 Benchmark]: RCFGBuilder took 5361.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 197.9 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. [2018-09-10 11:35:44,893 INFO L168 Benchmark]: TraceAbstraction took 108932.67 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -713.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-10 11:35:44,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 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 971.42 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 164.27 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 385.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 811.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -941.0 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5361.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 197.9 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108932.67 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -713.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 204]: 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: 1034]: Loop Invariant Derived loop invariant: (((((((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) || 130 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && 12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && 278 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) < 130) || 312 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23)) || ((0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 245 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && 278 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29)) || (((130 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 274) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || ((((12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 245 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 600084 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23)) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 600084)) || (11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 245 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13))) || !(15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8)) || (13 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9))) || !(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) < 312) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && 12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) || (0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13))) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4))) || !(10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25))) || (((130 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 245) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 13 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 274 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0 && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. SAFE Result, 108.8s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 74.9s AutomataDifference, 0.0s DeadEndRemovalTime, 10.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3022 SDtfs, 15202 SDslu, 3327 SDs, 0 SdLazy, 36936 SolverSat, 6311 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 58.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8617 GetRequests, 8396 SyntacticMatches, 8 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31980occurred in iteration=8, 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: 3.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 3955 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 734 PreInvPairs, 1014 NumberOfFragments, 1151 HoareAnnotationTreeSize, 734 FomulaSimplifications, 63984 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 21330 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 7886 NumberOfCodeBlocks, 7886 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 12000 ConstructedInterpolants, 0 QuantifiedInterpolants, 19854610 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6595 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 13633/14581 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/Problem11_label09_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-35-44-917.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label09_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-35-44-917.csv Received shutdown request...