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_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:55:17,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:55:17,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:55:17,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:55:17,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:55:17,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:55:17,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:55:17,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:55:17,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:55:17,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:55:17,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:55:17,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:55:17,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:55:17,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:55:17,400 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:55:17,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:55:17,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:55:17,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:55:17,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:55:17,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:55:17,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:55:17,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:55:17,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:55:17,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:55:17,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:55:17,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:55:17,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:55:17,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:55:17,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:55:17,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:55:17,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:55:17,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:55:17,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:55:17,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:55:17,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:55:17,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:55:17,425 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:55:17,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:55:17,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:55:17,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:55:17,441 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:55:17,442 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:55:17,442 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:55:17,442 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:55:17,442 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:55:17,442 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:55:17,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:55:17,443 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:55:17,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:55:17,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:55:17,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:55:17,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:55:17,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:55:17,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:55:17,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:55:17,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:55:17,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:55:17,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:55:17,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:55:17,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:55:17,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:55:17,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:55:17,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:55:17,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:55:17,446 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:55:17,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:55:17,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:55:17,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:55:17,447 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:55:17,447 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:55:17,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:55:17,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:55:17,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:55:17,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:55:17,534 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:55:17,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label33_true-unreach-call.c [2018-09-10 11:55:17,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c13d8db2/11385c45b6724958ae4cd7e70c23bbe0/FLAGdfeec00b2 [2018-09-10 11:55:18,345 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:55:18,346 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label33_true-unreach-call.c [2018-09-10 11:55:18,393 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c13d8db2/11385c45b6724958ae4cd7e70c23bbe0/FLAGdfeec00b2 [2018-09-10 11:55:18,416 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c13d8db2/11385c45b6724958ae4cd7e70c23bbe0 [2018-09-10 11:55:18,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:55:18,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:55:18,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:55:18,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:55:18,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:55:18,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:55:18" (1/1) ... [2018-09-10 11:55:18,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffb54d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:18, skipping insertion in model container [2018-09-10 11:55:18,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:55:18" (1/1) ... [2018-09-10 11:55:18,871 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:55:20,013 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:55:20,033 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:55:20,944 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:55:21,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21 WrapperNode [2018-09-10 11:55:21,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:55:21,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:55:21,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:55:21,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:55:21,332 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:55:21" (1/1) ... [2018-09-10 11:55:21,463 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:55:21" (1/1) ... [2018-09-10 11:55:21,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:55:21,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:55:21,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:55:21,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:55:22,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (1/1) ... [2018-09-10 11:55:22,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:55:22,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:55:22,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:55:22,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:55:22,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (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:55:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:55:22,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:55:22,958 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:55:22,959 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:55:22,959 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:55:22,959 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:55:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:55:22,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:55:22,959 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:55:22,960 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:55:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:55:22,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:55:22,960 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:55:22,960 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:55:36,418 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:55:36,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:55:36 BoogieIcfgContainer [2018-09-10 11:55:36,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:55:36,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:55:36,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:55:36,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:55:36,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:55:18" (1/3) ... [2018-09-10 11:55:36,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba19f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:55:36, skipping insertion in model container [2018-09-10 11:55:36,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:55:21" (2/3) ... [2018-09-10 11:55:36,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba19f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:55:36, skipping insertion in model container [2018-09-10 11:55:36,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:55:36" (3/3) ... [2018-09-10 11:55:36,427 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label33_true-unreach-call.c [2018-09-10 11:55:36,437 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:55:36,446 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:55:36,511 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:55:36,512 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:55:36,512 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:55:36,512 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:55:36,512 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:55:36,512 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:55:36,512 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:55:36,513 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:55:36,513 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:55:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-10 11:55:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-10 11:55:36,565 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:55:36,567 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] [2018-09-10 11:55:36,568 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:55:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash 126251956, now seen corresponding path program 1 times [2018-09-10 11:55:36,577 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:55:36,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:55:36,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:55:36,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:55:36,623 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:55:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:55:37,078 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-09-10 11:55:37,091 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:55:37,096 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:55:37,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:55:37,097 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:55:37,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:55:37,120 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:55:37,121 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:55:37,124 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-09-10 11:55:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:55:53,622 INFO L93 Difference]: Finished difference Result 4063 states and 7611 transitions. [2018-09-10 11:55:53,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:55:53,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-09-10 11:55:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:55:53,678 INFO L225 Difference]: With dead ends: 4063 [2018-09-10 11:55:53,678 INFO L226 Difference]: Without dead ends: 2937 [2018-09-10 11:55:53,695 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:55:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2018-09-10 11:55:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1982. [2018-09-10 11:55:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-09-10 11:55:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3456 transitions. [2018-09-10 11:55:53,898 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3456 transitions. Word has length 42 [2018-09-10 11:55:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:55:53,900 INFO L480 AbstractCegarLoop]: Abstraction has 1982 states and 3456 transitions. [2018-09-10 11:55:53,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:55:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3456 transitions. [2018-09-10 11:55:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-10 11:55:53,911 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:55:53,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,911 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:55:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1322744279, now seen corresponding path program 1 times [2018-09-10 11:55:53,912 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:55:53,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:55:53,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:55:53,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:55:53,914 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:55:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:55:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:55:54,352 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:55:54,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:55:54,352 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:55:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:55:54,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:55:54,355 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:55:54,355 INFO L87 Difference]: Start difference. First operand 1982 states and 3456 transitions. Second operand 6 states. [2018-09-10 11:56:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:56:13,250 INFO L93 Difference]: Finished difference Result 7277 states and 13063 transitions. [2018-09-10 11:56:13,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:56:13,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-09-10 11:56:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:56:13,290 INFO L225 Difference]: With dead ends: 7277 [2018-09-10 11:56:13,290 INFO L226 Difference]: Without dead ends: 5301 [2018-09-10 11:56:13,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:56:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2018-09-10 11:56:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5252. [2018-09-10 11:56:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2018-09-10 11:56:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8253 transitions. [2018-09-10 11:56:13,452 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8253 transitions. Word has length 113 [2018-09-10 11:56:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:56:13,453 INFO L480 AbstractCegarLoop]: Abstraction has 5252 states and 8253 transitions. [2018-09-10 11:56:13,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:56:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8253 transitions. [2018-09-10 11:56:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-10 11:56:13,456 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:56:13,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,457 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:56:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1140459512, now seen corresponding path program 1 times [2018-09-10 11:56:13,457 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:56:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:13,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:56:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:13,459 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:56:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:56:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:56:13,956 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:56:13,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:56:13,956 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:56:13,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:56:13,957 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:56:13,957 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:56:13,958 INFO L87 Difference]: Start difference. First operand 5252 states and 8253 transitions. Second operand 6 states. [2018-09-10 11:56:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:56:28,026 INFO L93 Difference]: Finished difference Result 17106 states and 27851 transitions. [2018-09-10 11:56:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:56:28,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-09-10 11:56:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:56:28,092 INFO L225 Difference]: With dead ends: 17106 [2018-09-10 11:56:28,092 INFO L226 Difference]: Without dead ends: 11860 [2018-09-10 11:56:28,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:56:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2018-09-10 11:56:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 11797. [2018-09-10 11:56:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11797 states. [2018-09-10 11:56:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11797 states to 11797 states and 17115 transitions. [2018-09-10 11:56:28,437 INFO L78 Accepts]: Start accepts. Automaton has 11797 states and 17115 transitions. Word has length 116 [2018-09-10 11:56:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:56:28,437 INFO L480 AbstractCegarLoop]: Abstraction has 11797 states and 17115 transitions. [2018-09-10 11:56:28,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:56:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11797 states and 17115 transitions. [2018-09-10 11:56:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-10 11:56:28,449 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:56:28,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:28,450 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:56:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1298757376, now seen corresponding path program 1 times [2018-09-10 11:56:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:56:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:28,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:56:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:28,452 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:56:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:56:28,754 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:56:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:56:29,039 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:56:29,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:56:29,040 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:56:29,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:56:29,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:56:29,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:56:29,041 INFO L87 Difference]: Start difference. First operand 11797 states and 17115 transitions. Second operand 6 states. [2018-09-10 11:56:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:56:41,132 INFO L93 Difference]: Finished difference Result 30506 states and 45619 transitions. [2018-09-10 11:56:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:56:41,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-09-10 11:56:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:56:41,209 INFO L225 Difference]: With dead ends: 30506 [2018-09-10 11:56:41,209 INFO L226 Difference]: Without dead ends: 18715 [2018-09-10 11:56:41,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:56:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2018-09-10 11:56:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 18585. [2018-09-10 11:56:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18585 states. [2018-09-10 11:56:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18585 states to 18585 states and 25982 transitions. [2018-09-10 11:56:41,653 INFO L78 Accepts]: Start accepts. Automaton has 18585 states and 25982 transitions. Word has length 120 [2018-09-10 11:56:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:56:41,653 INFO L480 AbstractCegarLoop]: Abstraction has 18585 states and 25982 transitions. [2018-09-10 11:56:41,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:56:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18585 states and 25982 transitions. [2018-09-10 11:56:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-10 11:56:41,656 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:56:41,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:41,657 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:56:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1630600116, now seen corresponding path program 1 times [2018-09-10 11:56:41,657 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:56:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:56:41,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:41,659 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:56:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:56:41,899 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:56:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:56:42,251 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:56:42,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:56:42,252 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:56:42,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:56:42,253 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:56:42,253 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:56:42,253 INFO L87 Difference]: Start difference. First operand 18585 states and 25982 transitions. Second operand 6 states. [2018-09-10 11:56:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:56:51,968 INFO L93 Difference]: Finished difference Result 48054 states and 74550 transitions. [2018-09-10 11:56:51,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:56:51,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-09-10 11:56:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:56:52,100 INFO L225 Difference]: With dead ends: 48054 [2018-09-10 11:56:52,100 INFO L226 Difference]: Without dead ends: 29475 [2018-09-10 11:56:52,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:56:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29475 states. [2018-09-10 11:56:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29475 to 29321. [2018-09-10 11:56:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29321 states. [2018-09-10 11:56:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29321 states to 29321 states and 42060 transitions. [2018-09-10 11:56:52,851 INFO L78 Accepts]: Start accepts. Automaton has 29321 states and 42060 transitions. Word has length 126 [2018-09-10 11:56:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:56:52,852 INFO L480 AbstractCegarLoop]: Abstraction has 29321 states and 42060 transitions. [2018-09-10 11:56:52,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:56:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 29321 states and 42060 transitions. [2018-09-10 11:56:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-10 11:56:52,855 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:56:52,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:52,855 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:56:52,855 INFO L82 PathProgramCache]: Analyzing trace with hash -738774746, now seen corresponding path program 1 times [2018-09-10 11:56:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:56:52,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:52,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:56:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:56:52,857 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:56:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:56:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:56:53,085 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:56:53,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:56:53,086 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:56:53,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:56:53,086 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:56:53,087 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:56:53,087 INFO L87 Difference]: Start difference. First operand 29321 states and 42060 transitions. Second operand 4 states. [2018-09-10 11:57:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:57:04,159 INFO L93 Difference]: Finished difference Result 75326 states and 113916 transitions. [2018-09-10 11:57:04,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:57:04,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-09-10 11:57:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:57:04,368 INFO L225 Difference]: With dead ends: 75326 [2018-09-10 11:57:04,368 INFO L226 Difference]: Without dead ends: 46011 [2018-09-10 11:57:04,451 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:57:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46011 states. [2018-09-10 11:57:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46011 to 45967. [2018-09-10 11:57:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45967 states. [2018-09-10 11:57:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45967 states to 45967 states and 65670 transitions. [2018-09-10 11:57:05,695 INFO L78 Accepts]: Start accepts. Automaton has 45967 states and 65670 transitions. Word has length 143 [2018-09-10 11:57:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:57:05,695 INFO L480 AbstractCegarLoop]: Abstraction has 45967 states and 65670 transitions. [2018-09-10 11:57:05,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:57:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 45967 states and 65670 transitions. [2018-09-10 11:57:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-10 11:57:05,715 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:57:05,716 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:57:05,716 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:57:05,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1681230959, now seen corresponding path program 1 times [2018-09-10 11:57:05,716 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:57:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:57:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:57:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:57:05,717 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:57:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:57:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 70 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:57:06,062 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:57:06,062 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:57:06,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:57:06,078 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:57:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:57:06,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:57:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-10 11:57:06,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:57:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 70 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:57:07,378 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:57:07,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2018-09-10 11:57:07,379 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:57:07,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:57:07,381 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:57:07,381 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:57:07,381 INFO L87 Difference]: Start difference. First operand 45967 states and 65670 transitions. Second operand 5 states. [2018-09-10 11:57:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:57:21,917 INFO L93 Difference]: Finished difference Result 133157 states and 210658 transitions. [2018-09-10 11:57:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 11:57:21,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2018-09-10 11:57:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:57:22,458 INFO L225 Difference]: With dead ends: 133157 [2018-09-10 11:57:22,459 INFO L226 Difference]: Without dead ends: 87196 [2018-09-10 11:57:22,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 452 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-10 11:57:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87196 states. [2018-09-10 11:57:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87196 to 86932. [2018-09-10 11:57:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86932 states. [2018-09-10 11:57:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86932 states to 86932 states and 124561 transitions. [2018-09-10 11:57:25,384 INFO L78 Accepts]: Start accepts. Automaton has 86932 states and 124561 transitions. Word has length 227 [2018-09-10 11:57:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:57:25,384 INFO L480 AbstractCegarLoop]: Abstraction has 86932 states and 124561 transitions. [2018-09-10 11:57:25,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:57:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 86932 states and 124561 transitions. [2018-09-10 11:57:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-10 11:57:25,415 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:57:25,416 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:57:25,416 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:57:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2136631979, now seen corresponding path program 1 times [2018-09-10 11:57:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:57:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:57:25,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:57:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:57:25,418 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:57:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:57:25,752 WARN L175 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-09-10 11:57:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-10 11:57:25,797 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:57:25,797 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:57:26,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:57:26,672 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:57:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:57:26,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:57:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-09-10 11:57:27,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:57:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-10 11:57:27,324 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:57:27,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2018-09-10 11:57:27,324 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:57:27,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:57:27,325 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:57:27,326 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:57:27,326 INFO L87 Difference]: Start difference. First operand 86932 states and 124561 transitions. Second operand 3 states. [2018-09-10 11:57:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:57:38,846 INFO L93 Difference]: Finished difference Result 225112 states and 335222 transitions. [2018-09-10 11:57:38,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:57:38,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2018-09-10 11:57:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:57:40,401 INFO L225 Difference]: With dead ends: 225112 [2018-09-10 11:57:40,401 INFO L226 Difference]: Without dead ends: 138186 [2018-09-10 11:57:40,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:57:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138186 states. [2018-09-10 11:57:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138186 to 138172. [2018-09-10 11:57:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138172 states. [2018-09-10 11:57:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138172 states to 138172 states and 191267 transitions. [2018-09-10 11:57:43,464 INFO L78 Accepts]: Start accepts. Automaton has 138172 states and 191267 transitions. Word has length 276 [2018-09-10 11:57:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:57:43,464 INFO L480 AbstractCegarLoop]: Abstraction has 138172 states and 191267 transitions. [2018-09-10 11:57:43,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:57:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 138172 states and 191267 transitions. [2018-09-10 11:57:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-10 11:57:43,494 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:57:43,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,494 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:57:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2011291402, now seen corresponding path program 1 times [2018-09-10 11:57:43,495 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:57:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:57:43,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:57:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:57:43,496 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:57:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:57:43,924 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:57:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:57:44,407 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:57:44,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:57:44,408 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:57:44,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:57:44,409 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:57:44,409 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:57:44,409 INFO L87 Difference]: Start difference. First operand 138172 states and 191267 transitions. Second operand 6 states. [2018-09-10 11:57:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:57:59,373 INFO L93 Difference]: Finished difference Result 285450 states and 404120 transitions. [2018-09-10 11:57:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:57:59,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 289 [2018-09-10 11:57:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:57:59,848 INFO L225 Difference]: With dead ends: 285450 [2018-09-10 11:57:59,848 INFO L226 Difference]: Without dead ends: 142391 [2018-09-10 11:58:00,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:58:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142391 states. [2018-09-10 11:58:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142391 to 142061. [2018-09-10 11:58:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142061 states. [2018-09-10 11:58:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142061 states to 142061 states and 180543 transitions. [2018-09-10 11:58:03,541 INFO L78 Accepts]: Start accepts. Automaton has 142061 states and 180543 transitions. Word has length 289 [2018-09-10 11:58:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:58:03,541 INFO L480 AbstractCegarLoop]: Abstraction has 142061 states and 180543 transitions. [2018-09-10 11:58:03,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:58:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 142061 states and 180543 transitions. [2018-09-10 11:58:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-10 11:58:03,555 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:58:03,555 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:58:03,556 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:58:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1751698409, now seen corresponding path program 1 times [2018-09-10 11:58:03,556 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:58:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:03,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:58:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:03,557 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:58:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:58:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:58:04,002 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:58:04,002 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:58:04,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:58:04,014 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:58:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:58:04,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:58:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-09-10 11:58:05,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:58:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-09-10 11:58:05,759 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 11:58:05,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-09-10 11:58:05,760 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:58:05,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:58:05,761 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:58:05,761 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:58:05,761 INFO L87 Difference]: Start difference. First operand 142061 states and 180543 transitions. Second operand 3 states. [2018-09-10 11:58:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:58:12,300 INFO L93 Difference]: Finished difference Result 282514 states and 359549 transitions. [2018-09-10 11:58:12,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:58:12,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-09-10 11:58:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:58:12,646 INFO L225 Difference]: With dead ends: 282514 [2018-09-10 11:58:12,647 INFO L226 Difference]: Without dead ends: 140459 [2018-09-10 11:58:14,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:58:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140459 states. [2018-09-10 11:58:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140459 to 138841. [2018-09-10 11:58:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138841 states. [2018-09-10 11:58:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138841 states to 138841 states and 165650 transitions. [2018-09-10 11:58:17,183 INFO L78 Accepts]: Start accepts. Automaton has 138841 states and 165650 transitions. Word has length 305 [2018-09-10 11:58:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:58:17,183 INFO L480 AbstractCegarLoop]: Abstraction has 138841 states and 165650 transitions. [2018-09-10 11:58:17,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:58:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 138841 states and 165650 transitions. [2018-09-10 11:58:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-09-10 11:58:17,199 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:58:17,200 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:58:17,200 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:58:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash 950534114, now seen corresponding path program 1 times [2018-09-10 11:58:17,200 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:58:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:17,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:58:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:17,202 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:58:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:58:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-10 11:58:17,463 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:58:17,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:58:17,463 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:58:17,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:58:17,464 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:58:17,464 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:58:17,464 INFO L87 Difference]: Start difference. First operand 138841 states and 165650 transitions. Second operand 3 states. [2018-09-10 11:58:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:58:27,149 INFO L93 Difference]: Finished difference Result 277677 states and 331656 transitions. [2018-09-10 11:58:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:58:27,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-09-10 11:58:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:58:27,456 INFO L225 Difference]: With dead ends: 277677 [2018-09-10 11:58:27,456 INFO L226 Difference]: Without dead ends: 135644 [2018-09-10 11:58:27,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:58:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135644 states. [2018-09-10 11:58:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135644 to 134035. [2018-09-10 11:58:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134035 states. [2018-09-10 11:58:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134035 states to 134035 states and 152084 transitions. [2018-09-10 11:58:29,772 INFO L78 Accepts]: Start accepts. Automaton has 134035 states and 152084 transitions. Word has length 349 [2018-09-10 11:58:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:58:29,773 INFO L480 AbstractCegarLoop]: Abstraction has 134035 states and 152084 transitions. [2018-09-10 11:58:29,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:58:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 134035 states and 152084 transitions. [2018-09-10 11:58:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-10 11:58:29,793 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:58:29,793 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:29,793 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:58:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1177418103, now seen corresponding path program 1 times [2018-09-10 11:58:29,794 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:58:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:29,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:58:29,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:29,795 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:58:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:58:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-10 11:58:33,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:58:33,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:58:33,777 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:58:33,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:58:33,777 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:58:33,777 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:58:33,778 INFO L87 Difference]: Start difference. First operand 134035 states and 152084 transitions. Second operand 4 states. [2018-09-10 11:58:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:58:48,215 INFO L93 Difference]: Finished difference Result 320594 states and 374012 transitions. [2018-09-10 11:58:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:58:48,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2018-09-10 11:58:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:58:48,610 INFO L225 Difference]: With dead ends: 320594 [2018-09-10 11:58:48,610 INFO L226 Difference]: Without dead ends: 185755 [2018-09-10 11:58:48,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:58:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185755 states. [2018-09-10 11:58:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185755 to 179304. [2018-09-10 11:58:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179304 states. [2018-09-10 11:58:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179304 states to 179304 states and 206450 transitions. [2018-09-10 11:58:51,060 INFO L78 Accepts]: Start accepts. Automaton has 179304 states and 206450 transitions. Word has length 402 [2018-09-10 11:58:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:58:51,060 INFO L480 AbstractCegarLoop]: Abstraction has 179304 states and 206450 transitions. [2018-09-10 11:58:51,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:58:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 179304 states and 206450 transitions. [2018-09-10 11:58:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-09-10 11:58:51,303 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:58:51,304 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:51,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:58:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2067953221, now seen corresponding path program 1 times [2018-09-10 11:58:51,305 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:58:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:51,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:58:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:58:51,306 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:58:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:58:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2018-09-10 11:58:52,921 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:58:52,921 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:58:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:58:52,928 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:58:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:58:53,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:58:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-09-10 11:58:53,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:58:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2018-09-10 11:58:54,380 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:58:54,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-09-10 11:58:54,381 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:58:54,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:58:54,382 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:58:54,382 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:58:54,383 INFO L87 Difference]: Start difference. First operand 179304 states and 206450 transitions. Second operand 3 states. [2018-09-10 11:59:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:59:00,913 INFO L93 Difference]: Finished difference Result 357739 states and 411944 transitions. [2018-09-10 11:59:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:59:00,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1027 [2018-09-10 11:59:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:59:01,317 INFO L225 Difference]: With dead ends: 357739 [2018-09-10 11:59:01,317 INFO L226 Difference]: Without dead ends: 178441 [2018-09-10 11:59:01,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2057 GetRequests, 2051 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:59:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178441 states. Received shutdown request... [2018-09-10 11:59:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178441 to 178436. [2018-09-10 11:59:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178436 states. [2018-09-10 11:59:03,700 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 11:59:03,706 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 11:59:03,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:59:03 BoogieIcfgContainer [2018-09-10 11:59:03,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:59:03,708 INFO L168 Benchmark]: Toolchain (without parser) took 225278.04 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 11:59:03,709 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:59:03,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2883.89 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:59:03,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 295.66 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:59:03,711 INFO L168 Benchmark]: Boogie Preprocessor took 1261.91 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:59:03,712 INFO L168 Benchmark]: RCFGBuilder took 13539.84 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 157.8 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 87.0 MB). Peak memory consumption was 745.3 MB. Max. memory is 7.1 GB. [2018-09-10 11:59:03,713 INFO L168 Benchmark]: TraceAbstraction took 207286.96 ms. Allocated memory was 2.7 GB in the beginning and 4.5 GB in the end (delta: 1.8 GB). Free memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: -398.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-10 11:59:03,718 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 2883.89 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 295.66 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 1261.91 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 13539.84 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 157.8 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 87.0 MB). Peak memory consumption was 745.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207286.96 ms. Allocated memory was 2.7 GB in the beginning and 4.5 GB in the end (delta: 1.8 GB). Free memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: -398.8 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: 117]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 117). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 207.2s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 168.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9541 SDtfs, 36943 SDslu, 4434 SDs, 0 SdLazy, 58037 SolverSat, 15779 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 130.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3761 GetRequests, 3688 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179304occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 11681 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 5370 NumberOfCodeBlocks, 5370 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7184 ConstructedInterpolants, 0 QuantifiedInterpolants, 5899828 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2842 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 4014/4189 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_label33_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-59-03-732.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label33_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-59-03-732.csv Completed graceful shutdown