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/Problem14_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:03:51,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:03:51,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:03:51,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:03:51,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:03:51,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:03:51,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:03:51,685 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:03:51,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:03:51,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:03:51,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:03:51,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:03:51,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:03:51,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:03:51,692 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:03:51,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:03:51,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:03:51,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:03:51,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:03:51,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:03:51,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:03:51,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:03:51,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:03:51,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:03:51,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:03:51,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:03:51,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:03:51,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:03:51,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:03:51,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:03:51,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:03:51,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:03:51,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:03:51,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:03:51,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:03:51,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:03:51,715 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 12:03:51,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:03:51,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:03:51,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:03:51,732 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:03:51,732 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:03:51,732 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:03:51,732 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:03:51,733 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:03:51,733 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:03:51,733 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:03:51,733 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:03:51,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:03:51,734 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:03:51,734 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:03:51,734 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:03:51,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:03:51,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:03:51,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:03:51,735 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:03:51,735 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:03:51,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:03:51,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:03:51,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:03:51,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:03:51,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:03:51,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:03:51,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:03:51,737 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:03:51,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:03:51,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:03:51,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:03:51,738 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:03:51,738 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:03:51,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:03:51,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:03:51,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:03:51,821 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:03:51,821 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:03:51,822 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label42_true-unreach-call_false-termination.c [2018-09-10 12:03:52,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e87668f/f1cf7d79cd56444fa29e1718242432d5/FLAG3713f4ce8 [2018-09-10 12:03:52,509 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:03:52,514 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label42_true-unreach-call_false-termination.c [2018-09-10 12:03:52,539 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e87668f/f1cf7d79cd56444fa29e1718242432d5/FLAG3713f4ce8 [2018-09-10 12:03:52,556 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e87668f/f1cf7d79cd56444fa29e1718242432d5 [2018-09-10 12:03:52,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:03:52,568 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:03:52,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:03:52,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:03:52,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:03:52,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:03:52" (1/1) ... [2018-09-10 12:03:52,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5569bc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:52, skipping insertion in model container [2018-09-10 12:03:52,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:03:52" (1/1) ... [2018-09-10 12:03:52,783 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:03:53,100 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:03:53,119 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:03:53,290 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:03:53,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53 WrapperNode [2018-09-10 12:03:53,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:03:53,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:03:53,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:03:53,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:03:53,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:03:53,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:03:53,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:03:53,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:03:53,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... [2018-09-10 12:03:53,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:03:53,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:03:53,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:03:53,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:03:53,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:03:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 12:03:53,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 12:03:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:03:53,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:03:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:03:53,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:03:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:03:53,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:03:57,791 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:03:57,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:03:57 BoogieIcfgContainer [2018-09-10 12:03:57,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:03:57,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:03:57,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:03:57,798 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:03:57,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:03:52" (1/3) ... [2018-09-10 12:03:57,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c7f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:03:57, skipping insertion in model container [2018-09-10 12:03:57,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:53" (2/3) ... [2018-09-10 12:03:57,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c7f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:03:57, skipping insertion in model container [2018-09-10 12:03:57,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:03:57" (3/3) ... [2018-09-10 12:03:57,805 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label42_true-unreach-call_false-termination.c [2018-09-10 12:03:57,817 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:03:57,829 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:03:57,887 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:03:57,888 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:03:57,888 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:03:57,888 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:03:57,888 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:03:57,888 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:03:57,889 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:03:57,889 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:03:57,889 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:03:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-10 12:03:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-10 12:03:57,926 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:57,927 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:57,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1021980375, now seen corresponding path program 1 times [2018-09-10 12:03:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:57,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:57,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:57,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:57,988 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:58,396 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:03:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:58,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:03:58,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 12:03:58,520 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:58,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:03:58,542 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:03:58,543 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:03:58,545 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-09-10 12:04:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:00,295 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-09-10 12:04:00,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:04:00,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-09-10 12:04:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:00,319 INFO L225 Difference]: With dead ends: 691 [2018-09-10 12:04:00,319 INFO L226 Difference]: Without dead ends: 434 [2018-09-10 12:04:00,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:04:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-09-10 12:04:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-09-10 12:04:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-10 12:04:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-09-10 12:04:00,416 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 49 [2018-09-10 12:04:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:00,417 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-09-10 12:04:00,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:04:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-09-10 12:04:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-10 12:04:00,425 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:00,425 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:00,426 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -772896945, now seen corresponding path program 1 times [2018-09-10 12:04:00,426 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:00,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:00,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:00,428 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:00,778 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:04:00,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:04:00,779 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:00,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:04:00,781 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:04:00,782 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:04:00,782 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-09-10 12:04:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:02,902 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-09-10 12:04:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:04:02,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-09-10 12:04:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:02,909 INFO L225 Difference]: With dead ends: 1062 [2018-09-10 12:04:02,909 INFO L226 Difference]: Without dead ends: 634 [2018-09-10 12:04:02,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:04:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-09-10 12:04:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-09-10 12:04:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-09-10 12:04:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-09-10 12:04:02,968 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 136 [2018-09-10 12:04:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:02,968 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-09-10 12:04:02,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:04:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-09-10 12:04:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-10 12:04:02,975 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:02,976 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:02,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1638264890, now seen corresponding path program 1 times [2018-09-10 12:04:02,977 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:02,979 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:03,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:04:03,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:04:03,199 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:03,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:04:03,200 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:04:03,200 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:04:03,200 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-09-10 12:04:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:06,971 INFO L93 Difference]: Finished difference Result 2352 states and 4016 transitions. [2018-09-10 12:04:06,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:04:06,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-09-10 12:04:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:06,992 INFO L225 Difference]: With dead ends: 2352 [2018-09-10 12:04:06,992 INFO L226 Difference]: Without dead ends: 1733 [2018-09-10 12:04:06,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:04:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2018-09-10 12:04:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2018-09-10 12:04:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2018-09-10 12:04:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2647 transitions. [2018-09-10 12:04:07,069 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2647 transitions. Word has length 145 [2018-09-10 12:04:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:07,070 INFO L480 AbstractCegarLoop]: Abstraction has 1733 states and 2647 transitions. [2018-09-10 12:04:07,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:04:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2647 transitions. [2018-09-10 12:04:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-10 12:04:07,091 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:07,091 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:04:07,091 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2042073586, now seen corresponding path program 1 times [2018-09-10 12:04:07,092 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:07,093 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:07,736 WARN L175 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-09-10 12:04:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 84 proven. 107 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:04:08,195 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:08,196 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:08,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:08,206 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:08,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-10 12:04:08,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:09,216 WARN L175 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-10 12:04:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 84 proven. 107 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:04:10,135 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:04:10,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 12:04:10,136 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:10,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:04:10,137 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:04:10,137 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:04:10,138 INFO L87 Difference]: Start difference. First operand 1733 states and 2647 transitions. Second operand 5 states. [2018-09-10 12:04:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:14,237 INFO L93 Difference]: Finished difference Result 4895 states and 7479 transitions. [2018-09-10 12:04:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:04:14,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2018-09-10 12:04:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:14,257 INFO L225 Difference]: With dead ends: 4895 [2018-09-10 12:04:14,257 INFO L226 Difference]: Without dead ends: 3168 [2018-09-10 12:04:14,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 543 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:04:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2018-09-10 12:04:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3119. [2018-09-10 12:04:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2018-09-10 12:04:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 4564 transitions. [2018-09-10 12:04:14,363 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 4564 transitions. Word has length 274 [2018-09-10 12:04:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:14,363 INFO L480 AbstractCegarLoop]: Abstraction has 3119 states and 4564 transitions. [2018-09-10 12:04:14,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:04:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 4564 transitions. [2018-09-10 12:04:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-09-10 12:04:14,379 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:14,379 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:14,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2146744798, now seen corresponding path program 1 times [2018-09-10 12:04:14,380 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:14,381 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:14,913 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:04:15,116 WARN L175 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:04:15,337 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:04:15,647 WARN L175 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-10 12:04:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 214 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:04:16,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:16,224 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:16,232 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:16,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 312 proven. 53 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-10 12:04:17,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 136 proven. 267 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:04:17,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:17,685 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:17,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:17,700 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:17,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 312 proven. 53 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-10 12:04:18,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 136 proven. 267 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:04:19,299 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:19,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8, 8, 8] total 26 [2018-09-10 12:04:19,299 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:19,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 12:04:19,301 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 12:04:19,301 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-10 12:04:19,301 INFO L87 Difference]: Start difference. First operand 3119 states and 4564 transitions. Second operand 15 states. [2018-09-10 12:04:20,294 WARN L175 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-09-10 12:04:22,490 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-09-10 12:04:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:24,906 INFO L93 Difference]: Finished difference Result 7593 states and 11040 transitions. [2018-09-10 12:04:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-10 12:04:24,907 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 359 [2018-09-10 12:04:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:24,930 INFO L225 Difference]: With dead ends: 7593 [2018-09-10 12:04:24,930 INFO L226 Difference]: Without dead ends: 4279 [2018-09-10 12:04:24,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1480 GetRequests, 1433 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=431, Invalid=1375, Unknown=0, NotChecked=0, Total=1806 [2018-09-10 12:04:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2018-09-10 12:04:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 3856. [2018-09-10 12:04:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3856 states. [2018-09-10 12:04:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 5033 transitions. [2018-09-10 12:04:25,067 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 5033 transitions. Word has length 359 [2018-09-10 12:04:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:25,068 INFO L480 AbstractCegarLoop]: Abstraction has 3856 states and 5033 transitions. [2018-09-10 12:04:25,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 12:04:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 5033 transitions. [2018-09-10 12:04:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-10 12:04:25,089 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:25,089 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:25,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1560968679, now seen corresponding path program 1 times [2018-09-10 12:04:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:25,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:25,091 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:25,732 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 12:04:25,989 WARN L175 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:04:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 261 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:26,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:26,482 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:26,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:26,489 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:26,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-09-10 12:04:26,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 126 proven. 210 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-09-10 12:04:27,217 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:04:27,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 16 [2018-09-10 12:04:27,218 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:27,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:04:27,218 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:04:27,219 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:04:27,219 INFO L87 Difference]: Start difference. First operand 3856 states and 5033 transitions. Second operand 5 states. [2018-09-10 12:04:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:29,898 INFO L93 Difference]: Finished difference Result 10932 states and 14499 transitions. [2018-09-10 12:04:29,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:04:29,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 384 [2018-09-10 12:04:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:29,939 INFO L225 Difference]: With dead ends: 10932 [2018-09-10 12:04:29,939 INFO L226 Difference]: Without dead ends: 7082 [2018-09-10 12:04:29,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 766 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:04:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7082 states. [2018-09-10 12:04:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7082 to 6416. [2018-09-10 12:04:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6416 states. [2018-09-10 12:04:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6416 states to 6416 states and 8244 transitions. [2018-09-10 12:04:30,201 INFO L78 Accepts]: Start accepts. Automaton has 6416 states and 8244 transitions. Word has length 384 [2018-09-10 12:04:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:30,202 INFO L480 AbstractCegarLoop]: Abstraction has 6416 states and 8244 transitions. [2018-09-10 12:04:30,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:04:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 6416 states and 8244 transitions. [2018-09-10 12:04:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-09-10 12:04:30,227 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:30,228 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:30,228 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -532383297, now seen corresponding path program 1 times [2018-09-10 12:04:30,229 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:30,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:30,230 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:31,141 WARN L175 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:04:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 400 proven. 111 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-09-10 12:04:31,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:31,480 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:31,489 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:31,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 680 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-09-10 12:04:32,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:32,382 WARN L175 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-10 12:04:32,638 WARN L175 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-10 12:04:32,885 WARN L175 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-09-10 12:04:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 400 proven. 111 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-09-10 12:04:33,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:33,291 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 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:33,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:33,308 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:33,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 674 proven. 8 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-09-10 12:04:34,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:34,245 WARN L175 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-09-10 12:04:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 400 proven. 111 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-09-10 12:04:34,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:34,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 8, 5] total 16 [2018-09-10 12:04:34,970 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:34,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 12:04:34,971 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 12:04:34,971 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:04:34,972 INFO L87 Difference]: Start difference. First operand 6416 states and 8244 transitions. Second operand 7 states. [2018-09-10 12:04:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:38,006 INFO L93 Difference]: Finished difference Result 14395 states and 18836 transitions. [2018-09-10 12:04:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:04:38,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 495 [2018-09-10 12:04:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:38,037 INFO L225 Difference]: With dead ends: 14395 [2018-09-10 12:04:38,038 INFO L226 Difference]: Without dead ends: 7985 [2018-09-10 12:04:38,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2000 GetRequests, 1970 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-09-10 12:04:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2018-09-10 12:04:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 7716. [2018-09-10 12:04:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7716 states. [2018-09-10 12:04:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7716 states to 7716 states and 9416 transitions. [2018-09-10 12:04:38,231 INFO L78 Accepts]: Start accepts. Automaton has 7716 states and 9416 transitions. Word has length 495 [2018-09-10 12:04:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:38,232 INFO L480 AbstractCegarLoop]: Abstraction has 7716 states and 9416 transitions. [2018-09-10 12:04:38,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 12:04:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7716 states and 9416 transitions. [2018-09-10 12:04:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-09-10 12:04:38,255 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:38,256 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:38,256 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:38,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1909945295, now seen corresponding path program 1 times [2018-09-10 12:04:38,256 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:38,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:38,258 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:39,001 WARN L175 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:04:39,200 WARN L175 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:04:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 541 proven. 481 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-09-10 12:04:40,242 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:40,242 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:40,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:40,250 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:40,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 895 proven. 2 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-09-10 12:04:41,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:41,361 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:04:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 535 proven. 111 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2018-09-10 12:04:41,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:41,757 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:41,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:41,773 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:42,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 687 proven. 210 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-09-10 12:04:42,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 246 proven. 689 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:04:43,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:43,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 8, 8] total 16 [2018-09-10 12:04:43,469 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:43,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 12:04:43,471 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 12:04:43,471 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:04:43,471 INFO L87 Difference]: Start difference. First operand 7716 states and 9416 transitions. Second operand 13 states. [2018-09-10 12:04:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:47,009 INFO L93 Difference]: Finished difference Result 16072 states and 20152 transitions. [2018-09-10 12:04:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:04:47,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 580 [2018-09-10 12:04:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:47,043 INFO L225 Difference]: With dead ends: 16072 [2018-09-10 12:04:47,044 INFO L226 Difference]: Without dead ends: 8161 [2018-09-10 12:04:47,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2350 GetRequests, 2309 SyntacticMatches, 17 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2018-09-10 12:04:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8161 states. [2018-09-10 12:04:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8161 to 7881. [2018-09-10 12:04:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7881 states. [2018-09-10 12:04:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 9307 transitions. [2018-09-10 12:04:47,251 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 9307 transitions. Word has length 580 [2018-09-10 12:04:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:47,252 INFO L480 AbstractCegarLoop]: Abstraction has 7881 states and 9307 transitions. [2018-09-10 12:04:47,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 12:04:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 9307 transitions. [2018-09-10 12:04:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-09-10 12:04:47,276 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:47,277 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:47,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1861912669, now seen corresponding path program 2 times [2018-09-10 12:04:47,277 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:47,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:47,279 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 567 proven. 533 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-09-10 12:04:48,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:48,911 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 12:04:48,920 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 12:04:49,124 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 12:04:49,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 12:04:49,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 947 proven. 2 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-09-10 12:04:49,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:49,643 WARN L175 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-09-10 12:04:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 561 proven. 111 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2018-09-10 12:04:50,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:50,503 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 12:04:50,521 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 12:04:50,960 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 12:04:50,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 12:04:50,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 932 proven. 17 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-09-10 12:04:51,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:52,160 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-09-10 12:04:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 240 proven. 747 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-10 12:04:54,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:54,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5, 10, 11] total 31 [2018-09-10 12:04:54,201 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:54,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-10 12:04:54,202 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-10 12:04:54,202 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-09-10 12:04:54,202 INFO L87 Difference]: Start difference. First operand 7881 states and 9307 transitions. Second operand 18 states. [2018-09-10 12:04:57,528 WARN L175 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-09-10 12:04:59,324 WARN L175 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-09-10 12:04:59,755 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-09-10 12:05:00,167 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-09-10 12:05:02,726 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-09-10 12:05:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:04,272 INFO L93 Difference]: Finished difference Result 19874 states and 24158 transitions. [2018-09-10 12:05:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-10 12:05:04,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 606 [2018-09-10 12:05:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:04,312 INFO L225 Difference]: With dead ends: 19874 [2018-09-10 12:05:04,312 INFO L226 Difference]: Without dead ends: 11999 [2018-09-10 12:05:04,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2501 GetRequests, 2422 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=812, Invalid=3610, Unknown=0, NotChecked=0, Total=4422 [2018-09-10 12:05:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2018-09-10 12:05:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 11268. [2018-09-10 12:05:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-10 12:05:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 12850 transitions. [2018-09-10 12:05:04,550 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 12850 transitions. Word has length 606 [2018-09-10 12:05:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:04,551 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 12850 transitions. [2018-09-10 12:05:04,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-10 12:05:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 12850 transitions. [2018-09-10 12:05:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2018-09-10 12:05:04,572 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:04,572 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:04,573 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1212171765, now seen corresponding path program 1 times [2018-09-10 12:05:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:04,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:04,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 12:05:04,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:04,576 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 568 proven. 111 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-09-10 12:05:05,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:05,581 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:05:05,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:05,589 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:05,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 955 proven. 2 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-09-10 12:05:06,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 568 proven. 111 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-09-10 12:05:06,586 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:06,586 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 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:05:06,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:06,603 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:07,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 955 proven. 2 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-09-10 12:05:07,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 568 proven. 111 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-09-10 12:05:07,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:05:07,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 9 [2018-09-10 12:05:07,878 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:05:07,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 12:05:07,880 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 12:05:07,880 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:05:07,881 INFO L87 Difference]: Start difference. First operand 11268 states and 12850 transitions. Second operand 7 states. [2018-09-10 12:05:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:10,669 INFO L93 Difference]: Finished difference Result 30818 states and 40305 transitions. [2018-09-10 12:05:10,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 12:05:10,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 680 [2018-09-10 12:05:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:10,775 INFO L225 Difference]: With dead ends: 30818 [2018-09-10 12:05:10,775 INFO L226 Difference]: Without dead ends: 19739 [2018-09-10 12:05:10,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2736 GetRequests, 2721 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-09-10 12:05:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19739 states. [2018-09-10 12:05:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19739 to 19279. [2018-09-10 12:05:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19279 states. [2018-09-10 12:05:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19279 states to 19279 states and 22388 transitions. [2018-09-10 12:05:11,333 INFO L78 Accepts]: Start accepts. Automaton has 19279 states and 22388 transitions. Word has length 680 [2018-09-10 12:05:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:11,335 INFO L480 AbstractCegarLoop]: Abstraction has 19279 states and 22388 transitions. [2018-09-10 12:05:11,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 12:05:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19279 states and 22388 transitions. [2018-09-10 12:05:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2018-09-10 12:05:11,362 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:11,363 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:11,363 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:11,363 INFO L82 PathProgramCache]: Analyzing trace with hash -448130418, now seen corresponding path program 1 times [2018-09-10 12:05:11,363 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:11,365 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 831 proven. 828 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2018-09-10 12:05:13,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:13,264 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:05:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:13,272 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:13,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1352 proven. 2 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2018-09-10 12:05:14,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:14,501 WARN L175 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-09-10 12:05:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 819 proven. 111 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2018-09-10 12:05:15,327 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:15,327 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 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:05:15,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:15,343 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:15,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1344 proven. 10 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2018-09-10 12:05:16,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 324 proven. 1068 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2018-09-10 12:05:17,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:05:17,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5, 8, 8] total 28 [2018-09-10 12:05:17,922 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:05:17,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-10 12:05:17,924 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-10 12:05:17,925 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2018-09-10 12:05:17,925 INFO L87 Difference]: Start difference. First operand 19279 states and 22388 transitions. Second operand 17 states. [2018-09-10 12:05:22,722 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-09-10 12:05:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:27,004 INFO L93 Difference]: Finished difference Result 38258 states and 46900 transitions. [2018-09-10 12:05:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-10 12:05:27,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 769 [2018-09-10 12:05:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:27,089 INFO L225 Difference]: With dead ends: 38258 [2018-09-10 12:05:27,089 INFO L226 Difference]: Without dead ends: 18384 [2018-09-10 12:05:27,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3159 GetRequests, 3082 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1098, Invalid=4014, Unknown=0, NotChecked=0, Total=5112 [2018-09-10 12:05:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18384 states. [2018-09-10 12:05:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18384 to 17896. [2018-09-10 12:05:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17896 states. [2018-09-10 12:05:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17896 states to 17896 states and 20346 transitions. [2018-09-10 12:05:27,549 INFO L78 Accepts]: Start accepts. Automaton has 17896 states and 20346 transitions. Word has length 769 [2018-09-10 12:05:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:27,550 INFO L480 AbstractCegarLoop]: Abstraction has 17896 states and 20346 transitions. [2018-09-10 12:05:27,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-10 12:05:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17896 states and 20346 transitions. [2018-09-10 12:05:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2018-09-10 12:05:27,564 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:27,565 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:27,565 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1576725498, now seen corresponding path program 1 times [2018-09-10 12:05:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:27,567 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:28,084 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:05:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 707 proven. 551 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-09-10 12:05:28,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:28,817 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:05:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:28,826 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:29,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 1272 proven. 2 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-09-10 12:05:29,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 778 proven. 111 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-09-10 12:05:30,038 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:30,038 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 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:05:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:30,056 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:30,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 1272 proven. 2 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-09-10 12:05:30,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 778 proven. 111 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-09-10 12:05:31,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:05:31,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5, 5, 5] total 16 [2018-09-10 12:05:31,399 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:05:31,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-10 12:05:31,400 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-10 12:05:31,401 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:05:31,401 INFO L87 Difference]: Start difference. First operand 17896 states and 20346 transitions. Second operand 14 states. [2018-09-10 12:05:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:43,488 INFO L93 Difference]: Finished difference Result 35727 states and 41172 transitions. [2018-09-10 12:05:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-10 12:05:43,489 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 840 [2018-09-10 12:05:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:43,532 INFO L225 Difference]: With dead ends: 35727 [2018-09-10 12:05:43,532 INFO L226 Difference]: Without dead ends: 17694 [2018-09-10 12:05:43,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3527 GetRequests, 3424 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3630 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1617, Invalid=8283, Unknown=0, NotChecked=0, Total=9900 [2018-09-10 12:05:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2018-09-10 12:05:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 17205. [2018-09-10 12:05:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17205 states. [2018-09-10 12:05:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17205 states to 17205 states and 18968 transitions. [2018-09-10 12:05:44,037 INFO L78 Accepts]: Start accepts. Automaton has 17205 states and 18968 transitions. Word has length 840 [2018-09-10 12:05:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:44,038 INFO L480 AbstractCegarLoop]: Abstraction has 17205 states and 18968 transitions. [2018-09-10 12:05:44,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-10 12:05:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17205 states and 18968 transitions. [2018-09-10 12:05:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2018-09-10 12:05:44,053 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:44,054 INFO L376 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:44,054 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -577011059, now seen corresponding path program 1 times [2018-09-10 12:05:44,055 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:44,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:44,056 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3245 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2018-09-10 12:05:44,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:05:44,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:05:44,977 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:05:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:05:44,978 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:05:44,978 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:05:44,978 INFO L87 Difference]: Start difference. First operand 17205 states and 18968 transitions. Second operand 4 states. [2018-09-10 12:05:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:46,598 INFO L93 Difference]: Finished difference Result 36854 states and 40824 transitions. [2018-09-10 12:05:46,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:05:46,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1081 [2018-09-10 12:05:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:46,605 INFO L225 Difference]: With dead ends: 36854 [2018-09-10 12:05:46,605 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:05:46,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:05:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:05:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:05:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:05:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:05:46,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1081 [2018-09-10 12:05:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:46,660 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:05:46,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:05:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:05:46,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:05:46,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:05:46,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:46,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:46,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:46,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:47,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:47,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:47,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:48,526 WARN L175 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 664 DAG size of output: 627 [2018-09-10 12:05:48,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:48,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:48,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:50,163 WARN L175 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 664 DAG size of output: 627 [2018-09-10 12:05:50,550 WARN L175 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 15 [2018-09-10 12:05:51,380 WARN L175 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 28 [2018-09-10 12:05:52,978 WARN L175 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 290 DAG size of output: 51 [2018-09-10 12:05:58,281 WARN L175 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 630 DAG size of output: 59 [2018-09-10 12:06:03,674 WARN L175 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 630 DAG size of output: 59 [2018-09-10 12:06:03,677 INFO L426 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-09-10 12:06:03,677 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-09-10 12:06:03,677 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,678 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 130) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,679 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-09-10 12:06:03,680 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-09-10 12:06:03,681 INFO L426 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:06:03,682 INFO L426 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:06:03,683 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,684 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,685 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-09-10 12:06:03,686 INFO L426 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-09-10 12:06:03,687 INFO L426 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:06:03,688 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-09-10 12:06:03,689 INFO L426 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-09-10 12:06:03,689 INFO L426 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-09-10 12:06:03,689 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,689 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,689 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,689 INFO L426 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-09-10 12:06:03,690 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 7)) (.cse0 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 9)) (.cse5 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 9)) (.cse2 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 10)) (.cse4 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 6)) .cse0 .cse2 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) .cse1 .cse3) (or .cse2 .cse5 (<= (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 43) 0) .cse3 .cse4) (or (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 12) .cse3 .cse4 .cse2) (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 8)) .cse2 .cse3 .cse4) (or .cse0 .cse2 .cse5 .cse3 .cse4) (or (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 10) .cse2 .cse3 .cse4))) [2018-09-10 12:06:03,690 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:06:03,690 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:06:03,690 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:06:03,690 INFO L426 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-09-10 12:06:03,690 INFO L426 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-09-10 12:06:03,690 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-09-10 12:06:03,691 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-09-10 12:06:03,692 INFO L426 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-09-10 12:06:03,693 INFO L426 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-09-10 12:06:03,694 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-09-10 12:06:03,695 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,696 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-09-10 12:06:03,697 INFO L426 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-09-10 12:06:03,698 INFO L426 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:06:03,699 INFO L426 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:06:03,700 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:06:03,701 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:06:03,702 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-09-10 12:06:03,702 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:06:03,702 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|)) [2018-09-10 12:06:03,702 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:06:03,702 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:06:03,702 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) [2018-09-10 12:06:03,702 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:06:03,702 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:06:03,703 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1))) [2018-09-10 12:06:03,703 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-09-10 12:06:03,703 INFO L422 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7))) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 10))) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 9))) (.cse4 (not (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)))) (or (and .cse0 (<= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) .cse1) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)) (and .cse0 (and .cse1 .cse2 .cse3)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and .cse0 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) .cse1) (and .cse0 (and .cse1 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (and .cse0 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43)) (and .cse1 .cse4)) (and .cse0 (and .cse2 .cse3 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7) (and .cse0 (and .cse1 .cse2 .cse4)))) [2018-09-10 12:06:03,703 INFO L426 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-09-10 12:06:03,703 INFO L426 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-09-10 12:06:03,703 INFO L426 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-09-10 12:06:03,704 INFO L422 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7))) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 10))) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 9))) (.cse4 (not (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)))) (or (and .cse0 (<= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) .cse1) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)) (and .cse0 (and .cse1 .cse2 .cse3)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and .cse0 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) .cse1) (and .cse0 (and .cse1 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (and .cse0 (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43)) (and .cse1 .cse4)) (and .cse0 (and .cse2 .cse3 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7) (and .cse0 (and .cse1 .cse2 .cse4)))) [2018-09-10 12:06:03,704 INFO L426 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-09-10 12:06:03,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:06:03 BoogieIcfgContainer [2018-09-10 12:06:03,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:06:03,727 INFO L168 Benchmark]: Toolchain (without parser) took 131160.69 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 12:06:03,728 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:06:03,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-10 12:06:03,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 12:06:03,730 INFO L168 Benchmark]: Boogie Preprocessor took 295.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:06:03,731 INFO L168 Benchmark]: RCFGBuilder took 4053.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 139.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. [2018-09-10 12:06:03,731 INFO L168 Benchmark]: TraceAbstraction took 125932.32 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-10 12:06:03,736 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 295.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.2 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4053.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 139.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125932.32 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 130]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && 12 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) + 49) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24) == 1)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7))) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) == 8)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21))) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) && 6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || 7 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) < 7) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 10) && (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9)) && !(9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 125.8s OverallTime, 13 OverallIterations, 9 TraceHistogramMax, 63.2s AutomataDifference, 0.0s DeadEndRemovalTime, 17.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1616 SDtfs, 28664 SDslu, 2732 SDs, 0 SdLazy, 34359 SolverSat, 5661 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19122 GetRequests, 18680 SyntacticMatches, 71 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7183 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19279occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 3864 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 414 PreInvPairs, 588 NumberOfFragments, 516 HoareAnnotationTreeSize, 414 FomulaSimplifications, 214271 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 195150 FormulaSimplificationTreeSizeReductionInter, 13.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 15714 NumberOfCodeBlocks, 15714 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 24985 ConstructedInterpolants, 0 QuantifiedInterpolants, 74092406 SizeOfPredicates, 60 NumberOfNonLiveVariables, 13876 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 44122/51951 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label42_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-06-03-753.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label42_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-06-03-753.csv Received shutdown request...