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/Problem12_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:46:15,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:46:15,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:46:15,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:46:15,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:46:15,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:46:15,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:46:15,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:46:15,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:46:15,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:46:15,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:46:15,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:46:15,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:46:15,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:46:15,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:46:15,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:46:15,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:46:15,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:46:15,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:46:15,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:46:15,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:46:15,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:46:15,570 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:46:15,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:46:15,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:46:15,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:46:15,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:46:15,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:46:15,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:46:15,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:46:15,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:46:15,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:46:15,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:46:15,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:46:15,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:46:15,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:46:15,589 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:46:15,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:46:15,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:46:15,625 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:46:15,628 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:46:15,628 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:46:15,628 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:46:15,629 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:46:15,629 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:46:15,629 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:46:15,629 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:46:15,630 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:46:15,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:46:15,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:46:15,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:46:15,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:46:15,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:46:15,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:46:15,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:46:15,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:46:15,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:46:15,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:46:15,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:46:15,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:46:15,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:46:15,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:46:15,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:46:15,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:46:15,636 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:46:15,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:46:15,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:46:15,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:46:15,637 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:46:15,637 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:46:15,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:46:15,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:46:15,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:46:15,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:46:15,723 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:46:15,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label27_true-unreach-call.c [2018-09-10 11:46:16,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acd679ec/5d7c89f1735946f5801982b3ab351319/FLAG6f63239aa [2018-09-10 11:46:16,609 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:46:16,610 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label27_true-unreach-call.c [2018-09-10 11:46:16,645 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acd679ec/5d7c89f1735946f5801982b3ab351319/FLAG6f63239aa [2018-09-10 11:46:16,660 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acd679ec/5d7c89f1735946f5801982b3ab351319 [2018-09-10 11:46:16,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:46:16,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:46:16,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:46:16,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:46:16,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:46:16,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:46:16" (1/1) ... [2018-09-10 11:46:16,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304117ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:16, skipping insertion in model container [2018-09-10 11:46:16,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:46:16" (1/1) ... [2018-09-10 11:46:17,067 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:46:18,126 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:46:18,149 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:46:18,838 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:46:19,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19 WrapperNode [2018-09-10 11:46:19,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:46:19,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:46:19,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:46:19,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:46:19,131 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:46:19" (1/1) ... [2018-09-10 11:46:19,226 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:46:19" (1/1) ... [2018-09-10 11:46:19,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:46:19,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:46:19,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:46:19,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:46:19,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:19,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:19,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:19,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:20,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:20,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:20,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (1/1) ... [2018-09-10 11:46:20,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:46:20,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:46:20,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:46:20,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:46:20,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (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:46:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:46:20,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:46:20,315 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:46:20,315 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:46:20,316 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:46:20,316 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:46:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:46:20,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:46:20,316 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:46:20,317 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:46:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:46:20,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:46:20,317 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:46:20,317 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:46:30,416 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:46:30,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:46:30 BoogieIcfgContainer [2018-09-10 11:46:30,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:46:30,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:46:30,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:46:30,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:46:30,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:46:16" (1/3) ... [2018-09-10 11:46:30,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b481c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:46:30, skipping insertion in model container [2018-09-10 11:46:30,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:46:19" (2/3) ... [2018-09-10 11:46:30,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b481c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:46:30, skipping insertion in model container [2018-09-10 11:46:30,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:46:30" (3/3) ... [2018-09-10 11:46:30,425 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label27_true-unreach-call.c [2018-09-10 11:46:30,434 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:46:30,444 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:46:30,503 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:46:30,504 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:46:30,504 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:46:30,504 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:46:30,504 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:46:30,504 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:46:30,504 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:46:30,505 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:46:30,505 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:46:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-09-10 11:46:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-10 11:46:30,553 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:46:30,554 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] [2018-09-10 11:46:30,555 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:46:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -993633692, now seen corresponding path program 1 times [2018-09-10 11:46:30,564 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:46:30,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:46:30,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:46:30,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:46:30,621 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:46:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:46:31,064 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:46:31,067 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:46:31,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:46:31,067 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:46:31,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:46:31,091 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:46:31,092 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:46:31,095 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-09-10 11:46:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:46:43,554 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-09-10 11:46:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:46:43,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-10 11:46:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:46:43,597 INFO L225 Difference]: With dead ends: 3234 [2018-09-10 11:46:43,598 INFO L226 Difference]: Without dead ends: 2388 [2018-09-10 11:46:43,609 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:46:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-09-10 11:46:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1604. [2018-09-10 11:46:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-09-10 11:46:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2600 transitions. [2018-09-10 11:46:43,791 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2600 transitions. Word has length 38 [2018-09-10 11:46:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:46:43,792 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2600 transitions. [2018-09-10 11:46:43,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:46:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2600 transitions. [2018-09-10 11:46:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-10 11:46:43,805 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:46:43,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:43,809 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:46:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2066474274, now seen corresponding path program 1 times [2018-09-10 11:46:43,810 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:46:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:46:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:46:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:46:43,811 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:46:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:46:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:46:44,319 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:46:44,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 11:46:44,319 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:46:44,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:46:44,322 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:46:44,322 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:46:44,322 INFO L87 Difference]: Start difference. First operand 1604 states and 2600 transitions. Second operand 5 states. [2018-09-10 11:46:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:46:56,886 INFO L93 Difference]: Finished difference Result 4873 states and 7923 transitions. [2018-09-10 11:46:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 11:46:56,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-09-10 11:46:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:46:56,917 INFO L225 Difference]: With dead ends: 4873 [2018-09-10 11:46:56,917 INFO L226 Difference]: Without dead ends: 3275 [2018-09-10 11:46:56,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:46:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-09-10 11:46:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-09-10 11:46:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-09-10 11:46:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4816 transitions. [2018-09-10 11:46:57,051 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4816 transitions. Word has length 118 [2018-09-10 11:46:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:46:57,051 INFO L480 AbstractCegarLoop]: Abstraction has 3241 states and 4816 transitions. [2018-09-10 11:46:57,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:46:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4816 transitions. [2018-09-10 11:46:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-10 11:46:57,064 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:46:57,064 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:57,065 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:46:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash -470921555, now seen corresponding path program 1 times [2018-09-10 11:46:57,065 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:46:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:46:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:46:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:46:57,067 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:46:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:46:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:46:57,418 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:46:57,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:46:57,418 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:46:57,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:46:57,419 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:46:57,419 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:46:57,421 INFO L87 Difference]: Start difference. First operand 3241 states and 4816 transitions. Second operand 6 states. [2018-09-10 11:47:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:47:10,844 INFO L93 Difference]: Finished difference Result 12870 states and 19656 transitions. [2018-09-10 11:47:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:47:10,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-09-10 11:47:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:47:10,900 INFO L225 Difference]: With dead ends: 12870 [2018-09-10 11:47:10,901 INFO L226 Difference]: Without dead ends: 9635 [2018-09-10 11:47:10,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:47:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2018-09-10 11:47:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 9567. [2018-09-10 11:47:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9567 states. [2018-09-10 11:47:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 13823 transitions. [2018-09-10 11:47:11,177 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 13823 transitions. Word has length 147 [2018-09-10 11:47:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:47:11,178 INFO L480 AbstractCegarLoop]: Abstraction has 9567 states and 13823 transitions. [2018-09-10 11:47:11,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:47:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 13823 transitions. [2018-09-10 11:47:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-10 11:47:11,182 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:47:11,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,183 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:47:11,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1790181547, now seen corresponding path program 1 times [2018-09-10 11:47:11,183 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:47:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:11,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:47:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:11,185 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:47:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:47:11,469 WARN L175 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:47:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:47:11,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:47:11,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:47:11,588 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:47:11,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:47:11,589 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:47:11,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:47:11,590 INFO L87 Difference]: Start difference. First operand 9567 states and 13823 transitions. Second operand 6 states. [2018-09-10 11:47:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:47:19,790 INFO L93 Difference]: Finished difference Result 25915 states and 39231 transitions. [2018-09-10 11:47:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:47:19,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2018-09-10 11:47:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:47:19,867 INFO L225 Difference]: With dead ends: 25915 [2018-09-10 11:47:19,867 INFO L226 Difference]: Without dead ends: 16354 [2018-09-10 11:47:19,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:47:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16354 states. [2018-09-10 11:47:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16354 to 16174. [2018-09-10 11:47:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16174 states. [2018-09-10 11:47:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16174 states to 16174 states and 23344 transitions. [2018-09-10 11:47:20,290 INFO L78 Accepts]: Start accepts. Automaton has 16174 states and 23344 transitions. Word has length 159 [2018-09-10 11:47:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:47:20,291 INFO L480 AbstractCegarLoop]: Abstraction has 16174 states and 23344 transitions. [2018-09-10 11:47:20,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:47:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 16174 states and 23344 transitions. [2018-09-10 11:47:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-10 11:47:20,295 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:47:20,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,295 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:47:20,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1588670579, now seen corresponding path program 1 times [2018-09-10 11:47:20,296 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:47:20,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:20,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:47:20,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:20,297 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:47:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:47:20,598 WARN L175 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:47:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:47:20,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:47:20,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:47:20,826 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:47:20,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:47:20,827 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:47:20,827 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:47:20,827 INFO L87 Difference]: Start difference. First operand 16174 states and 23344 transitions. Second operand 6 states. [2018-09-10 11:47:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:47:29,516 INFO L93 Difference]: Finished difference Result 39076 states and 58115 transitions. [2018-09-10 11:47:29,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:47:29,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-09-10 11:47:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:47:29,614 INFO L225 Difference]: With dead ends: 39076 [2018-09-10 11:47:29,614 INFO L226 Difference]: Without dead ends: 22908 [2018-09-10 11:47:29,665 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:47:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22908 states. [2018-09-10 11:47:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22908 to 22784. [2018-09-10 11:47:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22784 states. [2018-09-10 11:47:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22784 states to 22784 states and 31228 transitions. [2018-09-10 11:47:30,160 INFO L78 Accepts]: Start accepts. Automaton has 22784 states and 31228 transitions. Word has length 163 [2018-09-10 11:47:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:47:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 22784 states and 31228 transitions. [2018-09-10 11:47:30,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:47:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22784 states and 31228 transitions. [2018-09-10 11:47:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-10 11:47:30,165 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:47:30,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:30,166 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:47:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash -638709574, now seen corresponding path program 1 times [2018-09-10 11:47:30,166 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:47:30,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:30,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:47:30,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:30,170 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:47:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:47:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:47:30,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:47:30,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:47:30,427 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:47:30,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:47:30,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:47:30,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:47:30,429 INFO L87 Difference]: Start difference. First operand 22784 states and 31228 transitions. Second operand 4 states. [2018-09-10 11:47:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:47:40,773 INFO L93 Difference]: Finished difference Result 55063 states and 77275 transitions. [2018-09-10 11:47:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:47:40,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-09-10 11:47:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:47:40,888 INFO L225 Difference]: With dead ends: 55063 [2018-09-10 11:47:40,889 INFO L226 Difference]: Without dead ends: 32285 [2018-09-10 11:47:40,941 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:47:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32285 states. [2018-09-10 11:47:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32285 to 32281. [2018-09-10 11:47:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32281 states. [2018-09-10 11:47:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32281 states to 32281 states and 44030 transitions. [2018-09-10 11:47:41,531 INFO L78 Accepts]: Start accepts. Automaton has 32281 states and 44030 transitions. Word has length 184 [2018-09-10 11:47:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:47:41,531 INFO L480 AbstractCegarLoop]: Abstraction has 32281 states and 44030 transitions. [2018-09-10 11:47:41,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:47:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 32281 states and 44030 transitions. [2018-09-10 11:47:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-10 11:47:41,536 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:47:41,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,537 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:47:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash 659902685, now seen corresponding path program 1 times [2018-09-10 11:47:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:47:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:47:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:41,539 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:47:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:47:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:47:41,767 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:47:41,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:47:41,768 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:47:41,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:47:41,775 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:47:41,775 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:47:41,775 INFO L87 Difference]: Start difference. First operand 32281 states and 44030 transitions. Second operand 4 states. [2018-09-10 11:47:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:47:51,651 INFO L93 Difference]: Finished difference Result 116494 states and 170268 transitions. [2018-09-10 11:47:51,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:47:51,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-09-10 11:47:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:47:51,962 INFO L225 Difference]: With dead ends: 116494 [2018-09-10 11:47:51,963 INFO L226 Difference]: Without dead ends: 84219 [2018-09-10 11:47:52,083 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:47:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84219 states. [2018-09-10 11:47:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84219 to 84217. [2018-09-10 11:47:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84217 states. [2018-09-10 11:47:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84217 states to 84217 states and 113265 transitions. [2018-09-10 11:47:54,050 INFO L78 Accepts]: Start accepts. Automaton has 84217 states and 113265 transitions. Word has length 187 [2018-09-10 11:47:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:47:54,051 INFO L480 AbstractCegarLoop]: Abstraction has 84217 states and 113265 transitions. [2018-09-10 11:47:54,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:47:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 84217 states and 113265 transitions. [2018-09-10 11:47:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-10 11:47:54,106 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:47:54,107 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:47:54,107 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:47:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 14101186, now seen corresponding path program 1 times [2018-09-10 11:47:54,107 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:47:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:54,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:47:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:47:54,109 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:47:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:47:54,415 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:47:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 93 proven. 185 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-09-10 11:47:54,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:47:54,872 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:47:54,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:47:54,893 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:47:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:47:55,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:47:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-10 11:47:55,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:47:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 93 proven. 185 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-09-10 11:47:56,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:47:56,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 11:47:56,377 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:47:56,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:47:56,378 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:47:56,379 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 11:47:56,379 INFO L87 Difference]: Start difference. First operand 84217 states and 113265 transitions. Second operand 5 states. [2018-09-10 11:48:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:48:07,029 INFO L93 Difference]: Finished difference Result 193448 states and 264535 transitions. [2018-09-10 11:48:07,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:48:07,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 338 [2018-09-10 11:48:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:48:07,710 INFO L225 Difference]: With dead ends: 193448 [2018-09-10 11:48:07,710 INFO L226 Difference]: Without dead ends: 109237 [2018-09-10 11:48:07,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 671 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-10 11:48:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109237 states. [2018-09-10 11:48:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109237 to 109134. [2018-09-10 11:48:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109134 states. [2018-09-10 11:48:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109134 states to 109134 states and 143709 transitions. [2018-09-10 11:48:11,453 INFO L78 Accepts]: Start accepts. Automaton has 109134 states and 143709 transitions. Word has length 338 [2018-09-10 11:48:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:48:11,453 INFO L480 AbstractCegarLoop]: Abstraction has 109134 states and 143709 transitions. [2018-09-10 11:48:11,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:48:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 109134 states and 143709 transitions. [2018-09-10 11:48:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-10 11:48:11,502 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:48:11,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,503 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:48:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2102202640, now seen corresponding path program 1 times [2018-09-10 11:48:11,503 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:48:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:48:11,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:48:11,505 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:48:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:11,908 WARN L175 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:48:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 11:48:12,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:48:12,266 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:48:12,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:12,278 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:48:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:12,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:48:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:48:12,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:48:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:48:13,044 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 11:48:13,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-09-10 11:48:13,044 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:48:13,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:48:13,045 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:48:13,046 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:48:13,046 INFO L87 Difference]: Start difference. First operand 109134 states and 143709 transitions. Second operand 3 states. [2018-09-10 11:48:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:48:21,036 INFO L93 Difference]: Finished difference Result 249670 states and 329951 transitions. [2018-09-10 11:48:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:48:21,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2018-09-10 11:48:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:48:21,575 INFO L225 Difference]: With dead ends: 249670 [2018-09-10 11:48:21,575 INFO L226 Difference]: Without dead ends: 140542 [2018-09-10 11:48:21,834 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 705 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-10 11:48:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140542 states. [2018-09-10 11:48:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140542 to 140539. [2018-09-10 11:48:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140539 states. [2018-09-10 11:48:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140539 states to 140539 states and 175166 transitions. [2018-09-10 11:48:25,960 INFO L78 Accepts]: Start accepts. Automaton has 140539 states and 175166 transitions. Word has length 352 [2018-09-10 11:48:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:48:25,961 INFO L480 AbstractCegarLoop]: Abstraction has 140539 states and 175166 transitions. [2018-09-10 11:48:25,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:48:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 140539 states and 175166 transitions. [2018-09-10 11:48:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-10 11:48:25,994 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:48:25,994 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:48:25,995 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:48:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2132831411, now seen corresponding path program 1 times [2018-09-10 11:48:25,995 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:48:25,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:48:25,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:25,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:48:25,998 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:48:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 9 proven. 56 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-09-10 11:48:26,724 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:48:26,725 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:48:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:26,740 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:48:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:26,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:48:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-10 11:48:27,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:48:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 62 proven. 144 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:48:28,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:48:28,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2018-09-10 11:48:28,203 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:48:28,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:48:28,204 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:48:28,204 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-09-10 11:48:28,204 INFO L87 Difference]: Start difference. First operand 140539 states and 175166 transitions. Second operand 5 states. [2018-09-10 11:48:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:48:40,141 INFO L93 Difference]: Finished difference Result 304020 states and 381378 transitions. [2018-09-10 11:48:40,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-10 11:48:40,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2018-09-10 11:48:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:48:40,724 INFO L225 Difference]: With dead ends: 304020 [2018-09-10 11:48:40,725 INFO L226 Difference]: Without dead ends: 164255 [2018-09-10 11:48:40,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 728 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-10 11:48:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164255 states. [2018-09-10 11:48:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164255 to 162589. [2018-09-10 11:48:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162589 states. [2018-09-10 11:48:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162589 states to 162589 states and 201403 transitions. [2018-09-10 11:48:45,089 INFO L78 Accepts]: Start accepts. Automaton has 162589 states and 201403 transitions. Word has length 365 [2018-09-10 11:48:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:48:45,089 INFO L480 AbstractCegarLoop]: Abstraction has 162589 states and 201403 transitions. [2018-09-10 11:48:45,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:48:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 162589 states and 201403 transitions. [2018-09-10 11:48:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-09-10 11:48:45,139 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:48:45,140 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,140 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:48:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash 153438897, now seen corresponding path program 1 times [2018-09-10 11:48:45,140 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:48:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:48:45,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:48:45,142 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:48:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 172 proven. 217 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:48:47,465 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:48:47,465 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:48:47,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:47,472 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:48:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:47,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:48:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 323 proven. 39 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-10 11:48:48,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:48:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 103 proven. 286 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:48:53,101 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:48:53,101 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:48:53,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:48:53,119 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:48:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:48:53,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:48:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 323 proven. 39 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-10 11:48:53,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:48:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 103 proven. 286 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:48:54,710 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:48:54,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9, 9, 9] total 21 [2018-09-10 11:48:54,711 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:48:54,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-10 11:48:54,712 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-10 11:48:54,712 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-09-10 11:48:54,712 INFO L87 Difference]: Start difference. First operand 162589 states and 201403 transitions. Second operand 16 states. [2018-09-10 11:48:57,409 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-09-10 11:48:57,936 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-09-10 11:49:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:49:34,919 INFO L93 Difference]: Finished difference Result 406037 states and 494761 transitions. [2018-09-10 11:49:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-10 11:49:34,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 441 [2018-09-10 11:49:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:49:35,644 INFO L225 Difference]: With dead ends: 406037 [2018-09-10 11:49:35,644 INFO L226 Difference]: Without dead ends: 242379 [2018-09-10 11:49:35,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1841 GetRequests, 1783 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=709, Invalid=2153, Unknown=0, NotChecked=0, Total=2862 [2018-09-10 11:49:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242379 states. [2018-09-10 11:49:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242379 to 239164. [2018-09-10 11:49:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239164 states. [2018-09-10 11:49:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239164 states to 239164 states and 284421 transitions. [2018-09-10 11:49:40,586 INFO L78 Accepts]: Start accepts. Automaton has 239164 states and 284421 transitions. Word has length 441 [2018-09-10 11:49:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:49:40,586 INFO L480 AbstractCegarLoop]: Abstraction has 239164 states and 284421 transitions. [2018-09-10 11:49:40,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-10 11:49:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 239164 states and 284421 transitions. [2018-09-10 11:49:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-09-10 11:49:40,624 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:49:40,625 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:49:40,625 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:49:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1886292238, now seen corresponding path program 1 times [2018-09-10 11:49:40,625 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:49:40,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:49:40,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:49:40,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:49:40,628 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:49:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:49:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 14 proven. 85 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-09-10 11:49:41,164 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:49:41,164 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 11:49:41,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:49:41,174 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:49:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:49:41,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:49:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 14 proven. 85 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-09-10 11:49:43,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:49:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-09-10 11:49:43,868 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:49:43,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-09-10 11:49:43,869 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:49:43,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:49:43,870 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:49:43,870 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2018-09-10 11:49:43,870 INFO L87 Difference]: Start difference. First operand 239164 states and 284421 transitions. Second operand 3 states. [2018-09-10 11:49:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:49:55,515 INFO L93 Difference]: Finished difference Result 496611 states and 597712 transitions. [2018-09-10 11:49:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:49:55,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2018-09-10 11:49:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:49:56,147 INFO L225 Difference]: With dead ends: 496611 [2018-09-10 11:49:56,148 INFO L226 Difference]: Without dead ends: 258221 [2018-09-10 11:49:56,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 988 GetRequests, 977 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2018-09-10 11:49:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258221 states. Received shutdown request... [2018-09-10 11:49:57,416 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 11:49:57,423 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 11:49:57,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:49:57 BoogieIcfgContainer [2018-09-10 11:49:57,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:49:57,425 INFO L168 Benchmark]: Toolchain (without parser) took 220751.77 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -419.6 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-09-10 11:49:57,426 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 11:49:57,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2443.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:49:57,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 229.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 11:49:57,428 INFO L168 Benchmark]: Boogie Preprocessor took 894.02 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 932.2 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. [2018-09-10 11:49:57,429 INFO L168 Benchmark]: RCFGBuilder took 10172.22 ms. Allocated memory was 2.5 GB in the beginning and 2.6 GB in the end (delta: 151.0 MB). Free memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: -133.5 MB). Peak memory consumption was 724.9 MB. Max. memory is 7.1 GB. [2018-09-10 11:49:57,429 INFO L168 Benchmark]: TraceAbstraction took 207006.19 ms. Allocated memory was 2.6 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.5 GB in the beginning and 1.8 GB in the end (delta: 618.9 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-09-10 11:49:57,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2443.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 229.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 894.02 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 932.2 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10172.22 ms. Allocated memory was 2.5 GB in the beginning and 2.6 GB in the end (delta: 151.0 MB). Free memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: -133.5 MB). Peak memory consumption was 724.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207006.19 ms. Allocated memory was 2.6 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.5 GB in the beginning and 1.8 GB in the end (delta: 618.9 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 105). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 206.9s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 163.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5851 SDtfs, 39756 SDslu, 2377 SDs, 0 SdLazy, 72316 SolverSat, 15073 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 122.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5024 GetRequests, 4883 SyntacticMatches, 22 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239164occurred in iteration=11, 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 6183 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 5405 NumberOfCodeBlocks, 5405 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 7806 ConstructedInterpolants, 2 QuantifiedInterpolants, 16393421 SizeOfPredicates, 24 NumberOfNonLiveVariables, 3852 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 3849/5483 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/Problem12_label27_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-49-57-454.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem12_label27_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-49-57-454.csv Completed graceful shutdown