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/Problem13_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:51:04,224 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:51:04,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:51:04,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:51:04,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:51:04,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:51:04,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:51:04,243 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:51:04,245 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:51:04,246 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:51:04,247 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:51:04,247 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:51:04,248 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:51:04,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:51:04,250 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:51:04,251 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:51:04,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:51:04,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:51:04,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:51:04,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:51:04,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:51:04,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:51:04,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:51:04,270 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:51:04,270 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:51:04,271 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:51:04,272 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:51:04,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:51:04,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:51:04,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:51:04,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:51:04,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:51:04,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:51:04,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:51:04,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:51:04,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:51:04,280 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:51:04,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:51:04,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:51:04,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:51:04,307 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:51:04,308 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:51:04,308 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:51:04,308 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:51:04,308 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:51:04,308 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:51:04,309 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:51:04,309 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:51:04,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:51:04,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:51:04,310 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:51:04,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:51:04,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:51:04,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:51:04,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:51:04,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:51:04,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:51:04,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:51:04,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:51:04,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:51:04,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:51:04,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:51:04,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:51:04,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:51:04,315 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:51:04,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:51:04,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:51:04,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:51:04,316 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:51:04,316 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:51:04,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:51:04,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:51:04,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:51:04,415 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:51:04,416 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:51:04,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label00_true-unreach-call.c [2018-09-10 11:51:04,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cc4a44b/cb4d67c8ed844e81bd1ac5c0f0bea8fd/FLAGc8a8f04d7 [2018-09-10 11:51:05,257 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:51:05,258 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label00_true-unreach-call.c [2018-09-10 11:51:05,306 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cc4a44b/cb4d67c8ed844e81bd1ac5c0f0bea8fd/FLAGc8a8f04d7 [2018-09-10 11:51:05,327 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cc4a44b/cb4d67c8ed844e81bd1ac5c0f0bea8fd [2018-09-10 11:51:05,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:51:05,344 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:51:05,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:51:05,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:51:05,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:51:05,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:51:05" (1/1) ... [2018-09-10 11:51:05,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45717c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:05, skipping insertion in model container [2018-09-10 11:51:05,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:51:05" (1/1) ... [2018-09-10 11:51:05,758 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:51:06,931 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:51:06,950 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:51:07,830 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:51:08,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08 WrapperNode [2018-09-10 11:51:08,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:51:08,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:51:08,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:51:08,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:51:08,228 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:51:08" (1/1) ... [2018-09-10 11:51:08,342 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:51:08" (1/1) ... [2018-09-10 11:51:08,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:51:08,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:51:08,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:51:08,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:51:09,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (1/1) ... [2018-09-10 11:51:09,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:51:09,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:51:09,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:51:09,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:51:09,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (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:51:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:51:09,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:51:09,890 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:51:09,890 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:51:09,890 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_output3 [2018-09-10 11:51:09,891 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_output3 [2018-09-10 11:51:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:51:09,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:51:09,891 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_output4 [2018-09-10 11:51:09,891 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_output4 [2018-09-10 11:51:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:51:09,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:51:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 11:51:09,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 11:51:20,995 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:51:20,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:51:20 BoogieIcfgContainer [2018-09-10 11:51:20,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:51:20,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:51:20,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:51:21,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:51:21,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:51:05" (1/3) ... [2018-09-10 11:51:21,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5516e029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:51:21, skipping insertion in model container [2018-09-10 11:51:21,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:51:08" (2/3) ... [2018-09-10 11:51:21,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5516e029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:51:21, skipping insertion in model container [2018-09-10 11:51:21,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:51:20" (3/3) ... [2018-09-10 11:51:21,004 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label00_true-unreach-call.c [2018-09-10 11:51:21,014 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:51:21,023 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:51:21,083 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:51:21,083 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:51:21,084 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:51:21,084 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:51:21,084 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:51:21,084 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:51:21,084 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:51:21,084 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:51:21,085 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:51:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-10 11:51:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-10 11:51:21,136 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:51:21,137 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] [2018-09-10 11:51:21,138 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:51:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1069182300, now seen corresponding path program 1 times [2018-09-10 11:51:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:51:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:51:21,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:51:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:51:21,205 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:51:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:51:21,646 WARN L175 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:51:21,747 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:51:21,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:51:21,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:51:21,749 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:51:21,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:51:21,771 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:51:21,771 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:51:21,774 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-09-10 11:51:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:51:30,124 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-09-10 11:51:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:51:30,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-10 11:51:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:51:30,163 INFO L225 Difference]: With dead ends: 3097 [2018-09-10 11:51:30,163 INFO L226 Difference]: Without dead ends: 1975 [2018-09-10 11:51:30,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:51:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-09-10 11:51:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-09-10 11:51:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-09-10 11:51:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-09-10 11:51:30,353 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 44 [2018-09-10 11:51:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:51:30,354 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-09-10 11:51:30,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:51:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-09-10 11:51:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-10 11:51:30,361 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:51:30,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,362 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:51:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1691534068, now seen corresponding path program 1 times [2018-09-10 11:51:30,362 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:51:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:51:30,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:51:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:51:30,364 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:51:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:51:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:51:30,654 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:51:30,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 11:51:30,654 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:51:30,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:51:30,657 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:51:30,657 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:51:30,657 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-09-10 11:51:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:51:52,094 INFO L93 Difference]: Finished difference Result 5736 states and 9691 transitions. [2018-09-10 11:51:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 11:51:52,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-09-10 11:51:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:51:52,135 INFO L225 Difference]: With dead ends: 5736 [2018-09-10 11:51:52,135 INFO L226 Difference]: Without dead ends: 3768 [2018-09-10 11:51:52,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 11:51:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2018-09-10 11:51:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3686. [2018-09-10 11:51:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2018-09-10 11:51:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5660 transitions. [2018-09-10 11:51:52,279 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5660 transitions. Word has length 120 [2018-09-10 11:51:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:51:52,279 INFO L480 AbstractCegarLoop]: Abstraction has 3686 states and 5660 transitions. [2018-09-10 11:51:52,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:51:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5660 transitions. [2018-09-10 11:51:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-10 11:51:52,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:51:52,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,287 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:51:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash 642233136, now seen corresponding path program 1 times [2018-09-10 11:51:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:51:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:51:52,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:51:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:51:52,289 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:51:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:51:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:51:52,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:51:52,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 11:51:52,548 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:51:52,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:51:52,549 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:51:52,550 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:51:52,550 INFO L87 Difference]: Start difference. First operand 3686 states and 5660 transitions. Second operand 5 states. [2018-09-10 11:52:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:52:09,097 INFO L93 Difference]: Finished difference Result 12385 states and 19155 transitions. [2018-09-10 11:52:09,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 11:52:09,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-09-10 11:52:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:52:09,139 INFO L225 Difference]: With dead ends: 12385 [2018-09-10 11:52:09,140 INFO L226 Difference]: Without dead ends: 8705 [2018-09-10 11:52:09,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 11:52:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states. [2018-09-10 11:52:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 8670. [2018-09-10 11:52:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8670 states. [2018-09-10 11:52:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 12398 transitions. [2018-09-10 11:52:09,387 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 12398 transitions. Word has length 134 [2018-09-10 11:52:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:52:09,387 INFO L480 AbstractCegarLoop]: Abstraction has 8670 states and 12398 transitions. [2018-09-10 11:52:09,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:52:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 12398 transitions. [2018-09-10 11:52:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-10 11:52:09,393 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:52:09,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:09,394 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:52:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 96380732, now seen corresponding path program 1 times [2018-09-10 11:52:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:52:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:52:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:52:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:52:09,397 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:52:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:52:09,848 WARN L175 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-09-10 11:52:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:52:10,112 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:52:10,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:52:10,113 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:52:10,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:52:10,114 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:52:10,114 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:52:10,114 INFO L87 Difference]: Start difference. First operand 8670 states and 12398 transitions. Second operand 6 states. [2018-09-10 11:52:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:52:40,955 INFO L93 Difference]: Finished difference Result 26605 states and 38550 transitions. [2018-09-10 11:52:40,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 11:52:40,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-09-10 11:52:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:52:41,025 INFO L225 Difference]: With dead ends: 26605 [2018-09-10 11:52:41,025 INFO L226 Difference]: Without dead ends: 17941 [2018-09-10 11:52:41,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-09-10 11:52:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17941 states. [2018-09-10 11:52:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17941 to 17690. [2018-09-10 11:52:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17690 states. [2018-09-10 11:52:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17690 states to 17690 states and 25111 transitions. [2018-09-10 11:52:41,412 INFO L78 Accepts]: Start accepts. Automaton has 17690 states and 25111 transitions. Word has length 160 [2018-09-10 11:52:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:52:41,413 INFO L480 AbstractCegarLoop]: Abstraction has 17690 states and 25111 transitions. [2018-09-10 11:52:41,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:52:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 17690 states and 25111 transitions. [2018-09-10 11:52:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-10 11:52:41,417 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:52:41,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:41,417 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:52:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash -843772423, now seen corresponding path program 1 times [2018-09-10 11:52:41,418 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:52:41,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:52:41,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:52:41,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:52:41,419 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:52:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:52:42,080 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-09-10 11:52:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:52:42,112 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:52:42,113 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:52:42,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:52:42,132 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:52:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:52:42,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:52:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:52:42,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:52:42,783 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 11:52:42,889 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 11:52:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:52:43,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:52:43,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-09-10 11:52:43,349 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:52:43,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:52:43,350 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:52:43,351 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-09-10 11:52:43,351 INFO L87 Difference]: Start difference. First operand 17690 states and 25111 transitions. Second operand 6 states. [2018-09-10 11:53:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:53:02,863 INFO L93 Difference]: Finished difference Result 57955 states and 88413 transitions. [2018-09-10 11:53:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 11:53:02,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-09-10 11:53:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:53:03,083 INFO L225 Difference]: With dead ends: 57955 [2018-09-10 11:53:03,084 INFO L226 Difference]: Without dead ends: 41076 [2018-09-10 11:53:03,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-09-10 11:53:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41076 states. [2018-09-10 11:53:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41076 to 40875. [2018-09-10 11:53:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40875 states. [2018-09-10 11:53:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40875 states to 40875 states and 59673 transitions. [2018-09-10 11:53:04,356 INFO L78 Accepts]: Start accepts. Automaton has 40875 states and 59673 transitions. Word has length 174 [2018-09-10 11:53:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:53:04,357 INFO L480 AbstractCegarLoop]: Abstraction has 40875 states and 59673 transitions. [2018-09-10 11:53:04,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:53:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 40875 states and 59673 transitions. [2018-09-10 11:53:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-10 11:53:04,363 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:53:04,363 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:53:04,363 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:53:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 297769784, now seen corresponding path program 1 times [2018-09-10 11:53:04,364 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:53:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:53:04,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:53:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:53:04,365 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:53:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:53:04,651 WARN L175 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:53:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 74 proven. 71 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:53:05,054 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:53:05,054 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:53:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:53:05,068 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:53:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:53:05,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:53:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-09-10 11:53:05,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:53:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 74 proven. 71 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:53:06,618 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:53:06,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2018-09-10 11:53:06,619 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:53:06,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:53:06,621 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:53:06,621 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-09-10 11:53:06,621 INFO L87 Difference]: Start difference. First operand 40875 states and 59673 transitions. Second operand 5 states. [2018-09-10 11:53:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:53:24,138 INFO L93 Difference]: Finished difference Result 133981 states and 211466 transitions. [2018-09-10 11:53:24,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 11:53:24,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2018-09-10 11:53:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:53:24,550 INFO L225 Difference]: With dead ends: 133981 [2018-09-10 11:53:24,550 INFO L226 Difference]: Without dead ends: 93112 [2018-09-10 11:53:24,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-09-10 11:53:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93112 states. [2018-09-10 11:53:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93112 to 92758. [2018-09-10 11:53:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92758 states. [2018-09-10 11:53:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92758 states to 92758 states and 129707 transitions. [2018-09-10 11:53:26,807 INFO L78 Accepts]: Start accepts. Automaton has 92758 states and 129707 transitions. Word has length 198 [2018-09-10 11:53:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:53:26,808 INFO L480 AbstractCegarLoop]: Abstraction has 92758 states and 129707 transitions. [2018-09-10 11:53:26,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:53:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 92758 states and 129707 transitions. [2018-09-10 11:53:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-10 11:53:26,821 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:53:26,822 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:53:26,822 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:53:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1419513625, now seen corresponding path program 1 times [2018-09-10 11:53:26,823 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:53:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:53:26,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:53:26,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:53:26,824 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:53:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:53:27,159 WARN L175 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:53:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 75 proven. 26 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 11:53:27,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:53:27,646 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:53:27,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:53:27,663 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:53:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:53:27,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:53:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:53:28,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:53:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:53:28,498 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:53:28,498 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:53:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:53:28,527 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:53:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:53:28,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:53:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:53:28,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:53:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:53:29,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:53:29,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 18 [2018-09-10 11:53:29,157 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:53:29,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 11:53:29,158 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 11:53:29,158 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-10 11:53:29,159 INFO L87 Difference]: Start difference. First operand 92758 states and 129707 transitions. Second operand 9 states. [2018-09-10 11:53:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:53:53,624 INFO L93 Difference]: Finished difference Result 281593 states and 445519 transitions. [2018-09-10 11:53:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-10 11:53:53,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 265 [2018-09-10 11:53:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:53:54,490 INFO L225 Difference]: With dead ends: 281593 [2018-09-10 11:53:54,491 INFO L226 Difference]: Without dead ends: 189645 [2018-09-10 11:53:54,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1059 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=302, Invalid=1258, Unknown=0, NotChecked=0, Total=1560 [2018-09-10 11:53:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189645 states. [2018-09-10 11:53:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189645 to 189081. [2018-09-10 11:53:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189081 states. [2018-09-10 11:53:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189081 states to 189081 states and 252576 transitions. [2018-09-10 11:53:58,938 INFO L78 Accepts]: Start accepts. Automaton has 189081 states and 252576 transitions. Word has length 265 [2018-09-10 11:53:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:53:58,939 INFO L480 AbstractCegarLoop]: Abstraction has 189081 states and 252576 transitions. [2018-09-10 11:53:58,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 11:53:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 189081 states and 252576 transitions. [2018-09-10 11:53:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-10 11:53:58,951 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:53:58,951 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:53:58,951 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:53:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1294661756, now seen corresponding path program 1 times [2018-09-10 11:53:58,952 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:53:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:53:58,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:53:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:53:58,953 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:53:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:53:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-09-10 11:53:59,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:53:59,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:53:59,233 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:53:59,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:53:59,234 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:53:59,234 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:53:59,234 INFO L87 Difference]: Start difference. First operand 189081 states and 252576 transitions. Second operand 4 states. [2018-09-10 11:54:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:54:13,665 INFO L93 Difference]: Finished difference Result 406546 states and 555933 transitions. [2018-09-10 11:54:13,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:54:13,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-09-10 11:54:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:54:14,522 INFO L225 Difference]: With dead ends: 406546 [2018-09-10 11:54:14,522 INFO L226 Difference]: Without dead ends: 218275 [2018-09-10 11:54:14,879 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:54:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218275 states. [2018-09-10 11:54:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218275 to 217427. [2018-09-10 11:54:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217427 states. [2018-09-10 11:54:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217427 states to 217427 states and 281119 transitions. [2018-09-10 11:54:20,618 INFO L78 Accepts]: Start accepts. Automaton has 217427 states and 281119 transitions. Word has length 292 [2018-09-10 11:54:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:54:20,619 INFO L480 AbstractCegarLoop]: Abstraction has 217427 states and 281119 transitions. [2018-09-10 11:54:20,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:54:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 217427 states and 281119 transitions. [2018-09-10 11:54:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-09-10 11:54:20,694 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:54:20,695 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:54:20,695 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:54:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash -827193971, now seen corresponding path program 1 times [2018-09-10 11:54:20,695 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:54:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:54:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:54:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:54:20,696 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:54:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:54:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 286 proven. 140 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 11:54:21,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:54:21,183 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:54:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:54:21,192 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:54:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:54:21,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:54:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-09-10 11:54:21,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:54:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-09-10 11:54:21,729 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 11:54:21,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-10 11:54:21,729 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:54:21,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:54:21,730 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:54:21,730 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:54:21,730 INFO L87 Difference]: Start difference. First operand 217427 states and 281119 transitions. Second operand 3 states. [2018-09-10 11:54:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:54:35,199 INFO L93 Difference]: Finished difference Result 429761 states and 562123 transitions. [2018-09-10 11:54:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:54:35,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-09-10 11:54:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:54:35,922 INFO L225 Difference]: With dead ends: 429761 [2018-09-10 11:54:35,922 INFO L226 Difference]: Without dead ends: 213144 [2018-09-10 11:54:36,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 829 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:54:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213144 states. [2018-09-10 11:54:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213144 to 209927. [2018-09-10 11:54:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209927 states. [2018-09-10 11:54:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209927 states to 209927 states and 259802 transitions. [2018-09-10 11:54:40,159 INFO L78 Accepts]: Start accepts. Automaton has 209927 states and 259802 transitions. Word has length 414 [2018-09-10 11:54:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:54:40,160 INFO L480 AbstractCegarLoop]: Abstraction has 209927 states and 259802 transitions. [2018-09-10 11:54:40,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:54:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 209927 states and 259802 transitions. [2018-09-10 11:54:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-09-10 11:54:40,189 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:54:40,190 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:54:40,190 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:54:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1312101613, now seen corresponding path program 1 times [2018-09-10 11:54:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:54:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:54:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:54:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:54:40,191 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:54:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:54:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 208 proven. 93 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-10 11:54:40,848 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:54:40,848 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:54:40,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:54:40,861 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:54:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:54:41,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:54:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 336 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-10 11:54:41,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:54:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 336 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-10 11:54:41,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:54:41,385 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:54:41,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:54:41,400 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:54:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:54:41,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:54:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 11:54:42,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:54:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 11:54:42,874 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 11:54:42,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 15 [2018-09-10 11:54:42,875 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:54:42,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:54:42,876 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:54:42,876 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-09-10 11:54:42,877 INFO L87 Difference]: Start difference. First operand 209927 states and 259802 transitions. Second operand 5 states. [2018-09-10 11:54:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:54:51,418 INFO L93 Difference]: Finished difference Result 403422 states and 501647 transitions. [2018-09-10 11:54:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 11:54:51,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 415 [2018-09-10 11:54:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-09-10 11:54:52,495 INFO L225 Difference]: With dead ends: 403422 [2018-09-10 11:54:52,495 INFO L226 Difference]: Without dead ends: 208924 [2018-09-10 11:54:52,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1650 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-09-10 11:54:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208924 states. [2018-09-10 11:54:52,841 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 11:54:52,845 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 11:54:52,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:54:52 BoogieIcfgContainer [2018-09-10 11:54:52,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:54:52,846 INFO L168 Benchmark]: Toolchain (without parser) took 227504.52 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -541.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 11:54:52,847 INFO L168 Benchmark]: CDTParser took 0.20 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:54:52,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2871.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 338.2 MB. Max. memory is 7.1 GB. [2018-09-10 11:54:52,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 314.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-10 11:54:52,849 INFO L168 Benchmark]: Boogie Preprocessor took 1283.19 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-09-10 11:54:52,850 INFO L168 Benchmark]: RCFGBuilder took 11180.03 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 163.1 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 84.7 MB). Peak memory consumption was 744.8 MB. Max. memory is 7.1 GB. [2018-09-10 11:54:52,851 INFO L168 Benchmark]: TraceAbstraction took 211848.87 ms. Allocated memory was 2.7 GB in the beginning and 3.9 GB in the end (delta: 1.2 GB). Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 310.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-10 11:54:52,856 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.20 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 2871.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 338.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 314.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1283.19 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11180.03 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 163.1 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 84.7 MB). Peak memory consumption was 744.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211848.87 ms. Allocated memory was 2.7 GB in the beginning and 3.9 GB in the end (delta: 1.2 GB). Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 310.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 123). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 211.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 181.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6441 SDtfs, 35049 SDslu, 5019 SDs, 0 SdLazy, 64804 SolverSat, 16192 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 140.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4403 GetRequests, 4288 SyntacticMatches, 13 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217427occurred 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: 17.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 5553 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 4362 NumberOfCodeBlocks, 4362 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6484 ConstructedInterpolants, 0 QuantifiedInterpolants, 6154847 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3756 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 4814/5297 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label00_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-54-52-870.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label00_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-54-52-870.csv Completed graceful shutdown