/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:30,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:30,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:30,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:30,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:30,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:30,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:30,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:30,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:30,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:30,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:30,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:30,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:30,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:30,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:30,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:30,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:30,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:30,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:30,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:30,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:30,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:30,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:30,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:30,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:30,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:30,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:30,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:30,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:30,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:30,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:30,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:30,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:30,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:30,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:30,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:30,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:30,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:30,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:30,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:30,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:30,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:32:30,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:30,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:30,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:30,504 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:30,504 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:30,504 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:30,505 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:30,505 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:30,505 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:30,505 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:30,505 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:30,506 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:30,506 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:30,506 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:30,506 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:30,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:30,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:30,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:30,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:30,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:30,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:30,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:30,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:30,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:30,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:30,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:30,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:30,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:30,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:30,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:30,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:30,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:30,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:30,511 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:30,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:30,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:30,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:30,511 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:30,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:30,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:30,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:30,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:30,808 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:30,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-11-23 23:32:30,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd71d618/3ce6e3d016cf448697e6ce60e19415c8/FLAGfc4f6706d [2019-11-23 23:32:31,449 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:31,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-11-23 23:32:31,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd71d618/3ce6e3d016cf448697e6ce60e19415c8/FLAGfc4f6706d [2019-11-23 23:32:31,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd71d618/3ce6e3d016cf448697e6ce60e19415c8 [2019-11-23 23:32:31,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:31,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:31,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:31,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:31,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:31,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:31" (1/1) ... [2019-11-23 23:32:31,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17186da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:31, skipping insertion in model container [2019-11-23 23:32:31,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:31" (1/1) ... [2019-11-23 23:32:31,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:31,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:32,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:32,402 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:32,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:32,562 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:32,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32 WrapperNode [2019-11-23 23:32:32,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:32,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:32,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:32,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:32,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:32,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:32,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:32,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:32,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (1/1) ... [2019-11-23 23:32:32,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:32,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:32,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:32,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:32,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (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 [2019-11-23 23:32:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:32,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:34,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:34,954 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:34,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:34 BoogieIcfgContainer [2019-11-23 23:32:34,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:34,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:34,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:34,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:34,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:31" (1/3) ... [2019-11-23 23:32:34,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16664994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:34, skipping insertion in model container [2019-11-23 23:32:34,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:32" (2/3) ... [2019-11-23 23:32:34,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16664994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:34, skipping insertion in model container [2019-11-23 23:32:34,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:34" (3/3) ... [2019-11-23 23:32:34,968 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label24.c [2019-11-23 23:32:34,980 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:34,989 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:35,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:35,032 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:35,033 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:35,033 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:35,033 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:35,033 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:35,034 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:35,034 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:35,034 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:35,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:35,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:35,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:35,073 INFO L82 PathProgramCache]: Analyzing trace with hash 925956879, now seen corresponding path program 1 times [2019-11-23 23:32:35,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:35,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733368803] [2019-11-23 23:32:35,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:35,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733368803] [2019-11-23 23:32:35,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:35,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:35,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407355815] [2019-11-23 23:32:35,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:35,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:35,530 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:36,411 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:36,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:36,437 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:36,437 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:36,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 393 transitions. [2019-11-23 23:32:36,523 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 393 transitions. Word has length 80 [2019-11-23 23:32:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:36,524 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 393 transitions. [2019-11-23 23:32:36,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 393 transitions. [2019-11-23 23:32:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:32:36,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:36,530 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:36,530 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2137927517, now seen corresponding path program 1 times [2019-11-23 23:32:36,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:36,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377626083] [2019-11-23 23:32:36,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:36,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377626083] [2019-11-23 23:32:36,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:36,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:36,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987105321] [2019-11-23 23:32:36,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:36,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:36,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:36,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:36,594 INFO L87 Difference]: Start difference. First operand 243 states and 393 transitions. Second operand 3 states. [2019-11-23 23:32:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:36,986 INFO L93 Difference]: Finished difference Result 565 states and 925 transitions. [2019-11-23 23:32:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:36,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 23:32:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:36,991 INFO L225 Difference]: With dead ends: 565 [2019-11-23 23:32:36,991 INFO L226 Difference]: Without dead ends: 323 [2019-11-23 23:32:36,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-23 23:32:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-11-23 23:32:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 23:32:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 488 transitions. [2019-11-23 23:32:37,015 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 488 transitions. Word has length 89 [2019-11-23 23:32:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:37,015 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 488 transitions. [2019-11-23 23:32:37,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 488 transitions. [2019-11-23 23:32:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:32:37,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:37,021 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:37,021 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash 606390951, now seen corresponding path program 1 times [2019-11-23 23:32:37,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:37,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69364122] [2019-11-23 23:32:37,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:37,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69364122] [2019-11-23 23:32:37,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:37,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:37,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074527849] [2019-11-23 23:32:37,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:37,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:37,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:37,112 INFO L87 Difference]: Start difference. First operand 323 states and 488 transitions. Second operand 3 states. [2019-11-23 23:32:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:37,499 INFO L93 Difference]: Finished difference Result 725 states and 1115 transitions. [2019-11-23 23:32:37,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:37,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:32:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:37,503 INFO L225 Difference]: With dead ends: 725 [2019-11-23 23:32:37,503 INFO L226 Difference]: Without dead ends: 403 [2019-11-23 23:32:37,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-23 23:32:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2019-11-23 23:32:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 578 transitions. [2019-11-23 23:32:37,525 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 578 transitions. Word has length 93 [2019-11-23 23:32:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:37,526 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 578 transitions. [2019-11-23 23:32:37,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 578 transitions. [2019-11-23 23:32:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:32:37,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:37,531 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:37,532 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1484402026, now seen corresponding path program 1 times [2019-11-23 23:32:37,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:37,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50538377] [2019-11-23 23:32:37,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:32:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50538377] [2019-11-23 23:32:37,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:37,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:37,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578274571] [2019-11-23 23:32:37,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:37,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:37,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:37,586 INFO L87 Difference]: Start difference. First operand 403 states and 578 transitions. Second operand 3 states. [2019-11-23 23:32:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:38,067 INFO L93 Difference]: Finished difference Result 1125 states and 1641 transitions. [2019-11-23 23:32:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:38,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 23:32:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:38,074 INFO L225 Difference]: With dead ends: 1125 [2019-11-23 23:32:38,074 INFO L226 Difference]: Without dead ends: 723 [2019-11-23 23:32:38,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-23 23:32:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-23 23:32:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 23:32:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1004 transitions. [2019-11-23 23:32:38,106 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1004 transitions. Word has length 99 [2019-11-23 23:32:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:38,106 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1004 transitions. [2019-11-23 23:32:38,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1004 transitions. [2019-11-23 23:32:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 23:32:38,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:38,136 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:38,137 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash 40630988, now seen corresponding path program 1 times [2019-11-23 23:32:38,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:38,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173952118] [2019-11-23 23:32:38,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:38,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173952118] [2019-11-23 23:32:38,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:38,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:38,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105472323] [2019-11-23 23:32:38,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:38,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:38,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:38,288 INFO L87 Difference]: Start difference. First operand 723 states and 1004 transitions. Second operand 3 states. [2019-11-23 23:32:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:38,700 INFO L93 Difference]: Finished difference Result 1925 states and 2739 transitions. [2019-11-23 23:32:38,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:38,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-23 23:32:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:38,707 INFO L225 Difference]: With dead ends: 1925 [2019-11-23 23:32:38,707 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:38,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-11-23 23:32:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1649 transitions. [2019-11-23 23:32:38,736 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1649 transitions. Word has length 110 [2019-11-23 23:32:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1649 transitions. [2019-11-23 23:32:38,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1649 transitions. [2019-11-23 23:32:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-23 23:32:38,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:38,741 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:38,741 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:38,742 INFO L82 PathProgramCache]: Analyzing trace with hash 672109144, now seen corresponding path program 1 times [2019-11-23 23:32:38,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:38,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736952756] [2019-11-23 23:32:38,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 23:32:38,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736952756] [2019-11-23 23:32:38,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:38,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:38,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393834452] [2019-11-23 23:32:38,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:38,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:38,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:38,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:38,878 INFO L87 Difference]: Start difference. First operand 1203 states and 1649 transitions. Second operand 4 states. [2019-11-23 23:32:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:39,590 INFO L93 Difference]: Finished difference Result 2965 states and 4023 transitions. [2019-11-23 23:32:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:39,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-23 23:32:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:39,602 INFO L225 Difference]: With dead ends: 2965 [2019-11-23 23:32:39,602 INFO L226 Difference]: Without dead ends: 1683 [2019-11-23 23:32:39,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-23 23:32:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1203. [2019-11-23 23:32:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1609 transitions. [2019-11-23 23:32:39,648 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1609 transitions. Word has length 127 [2019-11-23 23:32:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:39,649 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1609 transitions. [2019-11-23 23:32:39,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1609 transitions. [2019-11-23 23:32:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 23:32:39,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:39,653 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 23:32:39,654 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1238566271, now seen corresponding path program 1 times [2019-11-23 23:32:39,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:39,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487431209] [2019-11-23 23:32:39,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 23:32:39,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487431209] [2019-11-23 23:32:39,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:39,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:39,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321128741] [2019-11-23 23:32:39,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:39,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:39,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:39,804 INFO L87 Difference]: Start difference. First operand 1203 states and 1609 transitions. Second operand 4 states. [2019-11-23 23:32:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:40,451 INFO L93 Difference]: Finished difference Result 2725 states and 3618 transitions. [2019-11-23 23:32:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:40,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-23 23:32:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:40,459 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:40,460 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:40,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2019-11-23 23:32:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-23 23:32:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1609 transitions. [2019-11-23 23:32:40,490 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1609 transitions. Word has length 168 [2019-11-23 23:32:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:40,491 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1609 transitions. [2019-11-23 23:32:40,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1609 transitions. [2019-11-23 23:32:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-23 23:32:40,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:40,495 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-23 23:32:40,496 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1905675099, now seen corresponding path program 1 times [2019-11-23 23:32:40,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:40,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202148037] [2019-11-23 23:32:40,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-23 23:32:40,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202148037] [2019-11-23 23:32:40,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:40,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:40,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773658608] [2019-11-23 23:32:40,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:40,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:40,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:40,583 INFO L87 Difference]: Start difference. First operand 1363 states and 1609 transitions. Second operand 3 states. [2019-11-23 23:32:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:40,918 INFO L93 Difference]: Finished difference Result 3205 states and 3772 transitions. [2019-11-23 23:32:40,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:40,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-23 23:32:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:40,929 INFO L225 Difference]: With dead ends: 3205 [2019-11-23 23:32:40,929 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:40,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1448 transitions. [2019-11-23 23:32:40,959 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1448 transitions. Word has length 204 [2019-11-23 23:32:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:40,959 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1448 transitions. [2019-11-23 23:32:40,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1448 transitions. [2019-11-23 23:32:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-23 23:32:40,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:40,963 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:40,964 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -537670642, now seen corresponding path program 1 times [2019-11-23 23:32:40,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:40,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128353010] [2019-11-23 23:32:40,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:32:41,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128353010] [2019-11-23 23:32:41,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:41,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:41,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807185232] [2019-11-23 23:32:41,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:41,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:41,132 INFO L87 Difference]: Start difference. First operand 1283 states and 1448 transitions. Second operand 4 states. [2019-11-23 23:32:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:41,600 INFO L93 Difference]: Finished difference Result 2483 states and 2814 transitions. [2019-11-23 23:32:41,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:41,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-23 23:32:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:41,601 INFO L225 Difference]: With dead ends: 2483 [2019-11-23 23:32:41,601 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:41,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:41,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2019-11-23 23:32:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:41,606 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:41,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:41,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:41,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:41,800 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-23 23:32:41,964 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-23 23:32:41,968 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:41,968 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:41,968 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:41,968 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:41,968 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:41,968 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:41,969 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:41,970 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:41,971 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:41,976 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:41,976 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:41,976 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:41,977 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:41,978 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:41,978 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2019-11-23 23:32:41,978 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:41,978 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:41,978 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:41,978 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:41,979 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse2 (= ~a17~0 8)) (.cse0 (<= ~a19~0 0)) (.cse4 (not (= ~a28~0 11))) (.cse7 (= ~a28~0 10)) (.cse1 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse6 (= ~a11~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 (not (= ~a28~0 9)) .cse4) (and .cse3 (= ~a28~0 7) .cse5 .cse6) (and .cse7 .cse1 .cse3) (and .cse2 .cse5 .cse4) (and .cse0 .cse4) (and (<= 11 ~a28~0) .cse3 .cse5) (and .cse7 .cse1 .cse6) (and (<= 10 ~a28~0) .cse1 .cse3 .cse6)))) [2019-11-23 23:32:41,979 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:41,979 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:41,979 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:41,979 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:41,979 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse2 (= ~a17~0 8)) (.cse0 (<= ~a19~0 0)) (.cse4 (not (= ~a28~0 11))) (.cse7 (= ~a28~0 10)) (.cse1 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse6 (= ~a11~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 (not (= ~a28~0 9)) .cse4) (and .cse3 (= ~a28~0 7) .cse5 .cse6) (and .cse7 .cse1 .cse3) (and .cse2 .cse5 .cse4) (and .cse0 .cse4) (and (<= 11 ~a28~0) .cse3 .cse5) (and .cse7 .cse1 .cse6) (and (<= 10 ~a28~0) .cse1 .cse3 .cse6)))) [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:41,980 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:41,981 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:41,982 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:41,983 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:41,984 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:42,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:42 BoogieIcfgContainer [2019-11-23 23:32:42,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:42,028 INFO L168 Benchmark]: Toolchain (without parser) took 10285.40 ms. Allocated memory was 145.8 MB in the beginning and 379.6 MB in the end (delta: 233.8 MB). Free memory was 100.8 MB in the beginning and 148.7 MB in the end (delta: -47.8 MB). Peak memory consumption was 186.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,028 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:32:42,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.46 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.8 MB in the beginning and 171.4 MB in the end (delta: -70.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.79 ms. Allocated memory is still 205.0 MB. Free memory was 171.4 MB in the beginning and 165.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,035 INFO L168 Benchmark]: Boogie Preprocessor took 80.32 ms. Allocated memory is still 205.0 MB. Free memory was 165.4 MB in the beginning and 161.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,036 INFO L168 Benchmark]: RCFGBuilder took 2226.10 ms. Allocated memory was 205.0 MB in the beginning and 249.6 MB in the end (delta: 44.6 MB). Free memory was 161.4 MB in the beginning and 192.0 MB in the end (delta: -30.7 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,038 INFO L168 Benchmark]: TraceAbstraction took 7068.75 ms. Allocated memory was 249.6 MB in the beginning and 379.6 MB in the end (delta: 130.0 MB). Free memory was 192.0 MB in the beginning and 148.7 MB in the end (delta: 43.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:42,048 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.46 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.8 MB in the beginning and 171.4 MB in the end (delta: -70.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.79 ms. Allocated memory is still 205.0 MB. Free memory was 171.4 MB in the beginning and 165.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.32 ms. Allocated memory is still 205.0 MB. Free memory was 165.4 MB in the beginning and 161.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2226.10 ms. Allocated memory was 205.0 MB in the beginning and 249.6 MB in the end (delta: 44.6 MB). Free memory was 161.4 MB in the beginning and 192.0 MB in the end (delta: -30.7 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7068.75 ms. Allocated memory was 249.6 MB in the beginning and 379.6 MB in the end (delta: 130.0 MB). Free memory was 192.0 MB in the beginning and 148.7 MB in the end (delta: 43.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 514]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((a19 <= 0 && !(a25 == 1)) || ((a17 == 8 && a19 == 1) && !(a28 == 11))) || ((a17 == 8 && !(a28 == 9)) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (a19 <= 0 && !(a28 == 11))) || ((11 <= a28 && a19 == 1) && a25 == 1)) || ((a28 == 10 && !(a25 == 1)) && a11 == 1)) || (((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((a19 <= 0 && !(a25 == 1)) || ((a17 == 8 && a19 == 1) && !(a28 == 11))) || ((a17 == 8 && !(a28 == 9)) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (a19 <= 0 && !(a28 == 11))) || ((11 <= a28 && a19 == 1) && a25 == 1)) || ((a28 == 10 && !(a25 == 1)) && a11 == 1)) || (((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 796 SDtfs, 967 SDslu, 69 SDs, 0 SdLazy, 2709 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1363occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 480 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 221 HoareAnnotationTreeSize, 3 FomulaSimplifications, 704 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 315953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 735/735 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...