/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/ssh-simplified/s3_srvr_12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:02:49,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:02:49,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:02:49,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:02:49,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:02:49,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:02:49,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:02:49,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:02:49,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:02:49,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:02:49,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:02:49,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:02:49,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:02:49,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:02:49,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:02:49,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:02:49,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:02:49,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:02:49,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:02:49,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:02:49,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:02:49,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:02:49,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:02:49,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:02:49,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:02:49,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:02:49,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:02:49,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:02:49,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:02:49,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:02:49,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:02:49,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:02:49,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:02:49,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:02:49,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:02:49,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:02:49,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:02:49,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:02:49,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:02:49,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:02:49,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:02:49,191 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-24 06:02:49,214 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:02:49,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:02:49,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:02:49,216 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:02:49,216 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:02:49,216 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:02:49,216 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:02:49,217 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:02:49,217 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:02:49,217 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:02:49,218 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:02:49,218 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:02:49,219 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:02:49,219 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:02:49,219 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:02:49,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:02:49,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:02:49,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:02:49,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:02:49,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:02:49,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:02:49,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:02:49,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:02:49,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:02:49,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:02:49,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:02:49,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:02:49,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:02:49,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:02:49,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:02:49,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:02:49,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:02:49,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:02:49,226 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:02:49,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:02:49,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:02:49,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:02:49,227 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:02:49,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:02:49,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:02:49,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:02:49,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:02:49,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:02:49,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_12.cil.c [2019-11-24 06:02:49,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e02fde8/a3b4da8017734156ba1c7089f8b4594d/FLAG245b23b33 [2019-11-24 06:02:50,102 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:02:50,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_12.cil.c [2019-11-24 06:02:50,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e02fde8/a3b4da8017734156ba1c7089f8b4594d/FLAG245b23b33 [2019-11-24 06:02:50,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e02fde8/a3b4da8017734156ba1c7089f8b4594d [2019-11-24 06:02:50,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:02:50,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:02:50,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:02:50,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:02:50,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:02:50,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:50,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e22e22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50, skipping insertion in model container [2019-11-24 06:02:50,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:50,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:02:50,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:02:50,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:02:50,768 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:02:50,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:02:50,980 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:02:50,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50 WrapperNode [2019-11-24 06:02:50,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:02:50,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:02:50,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:02:50,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:02:50,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:50,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:02:51,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:02:51,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:02:51,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:02:51,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (1/1) ... [2019-11-24 06:02:51,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:02:51,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:02:51,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:02:51,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:02:51,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (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-24 06:02:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:02:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:02:51,282 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 06:02:52,031 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-24 06:02:52,032 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-24 06:02:52,429 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:02:52,430 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-24 06:02:52,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:02:52 BoogieIcfgContainer [2019-11-24 06:02:52,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:02:52,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:02:52,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:02:52,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:02:52,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:02:50" (1/3) ... [2019-11-24 06:02:52,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ffba8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:02:52, skipping insertion in model container [2019-11-24 06:02:52,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:02:50" (2/3) ... [2019-11-24 06:02:52,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ffba8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:02:52, skipping insertion in model container [2019-11-24 06:02:52,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:02:52" (3/3) ... [2019-11-24 06:02:52,439 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-24 06:02:52,449 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:02:52,457 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:02:52,470 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:02:52,505 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:02:52,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:02:52,507 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:02:52,507 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:02:52,507 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:02:52,508 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:02:52,508 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:02:52,508 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:02:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-11-24 06:02:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 06:02:52,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:52,541 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] [2019-11-24 06:02:52,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -814957616, now seen corresponding path program 1 times [2019-11-24 06:02:52,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:52,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632578867] [2019-11-24 06:02:52,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:52,824 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-24 06:02:52,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632578867] [2019-11-24 06:02:52,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:52,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:52,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582750035] [2019-11-24 06:02:52,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:52,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:52,850 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2019-11-24 06:02:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:53,080 INFO L93 Difference]: Finished difference Result 257 states and 449 transitions. [2019-11-24 06:02:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:53,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 06:02:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:53,096 INFO L225 Difference]: With dead ends: 257 [2019-11-24 06:02:53,097 INFO L226 Difference]: Without dead ends: 134 [2019-11-24 06:02:53,101 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-24 06:02:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-24 06:02:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-24 06:02:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-24 06:02:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2019-11-24 06:02:53,155 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 21 [2019-11-24 06:02:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:53,155 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2019-11-24 06:02:53,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2019-11-24 06:02:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 06:02:53,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:53,157 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] [2019-11-24 06:02:53,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1704208736, now seen corresponding path program 1 times [2019-11-24 06:02:53,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:53,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426915836] [2019-11-24 06:02:53,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:53,226 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-24 06:02:53,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426915836] [2019-11-24 06:02:53,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:53,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:53,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464477601] [2019-11-24 06:02:53,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:53,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:53,231 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand 3 states. [2019-11-24 06:02:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:53,421 INFO L93 Difference]: Finished difference Result 275 states and 417 transitions. [2019-11-24 06:02:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:53,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 06:02:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:53,424 INFO L225 Difference]: With dead ends: 275 [2019-11-24 06:02:53,424 INFO L226 Difference]: Without dead ends: 143 [2019-11-24 06:02:53,425 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-24 06:02:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-24 06:02:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2019-11-24 06:02:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-24 06:02:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2019-11-24 06:02:53,440 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 23 [2019-11-24 06:02:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:53,440 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2019-11-24 06:02:53,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2019-11-24 06:02:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 06:02:53,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:53,442 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] [2019-11-24 06:02:53,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1765644408, now seen corresponding path program 1 times [2019-11-24 06:02:53,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:53,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74044449] [2019-11-24 06:02:53,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:53,499 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-24 06:02:53,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74044449] [2019-11-24 06:02:53,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:53,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:53,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798884024] [2019-11-24 06:02:53,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:53,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:53,502 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand 3 states. [2019-11-24 06:02:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:53,685 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-24 06:02:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:53,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 06:02:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:53,693 INFO L225 Difference]: With dead ends: 286 [2019-11-24 06:02:53,693 INFO L226 Difference]: Without dead ends: 153 [2019-11-24 06:02:53,695 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-24 06:02:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-24 06:02:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-11-24 06:02:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-24 06:02:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2019-11-24 06:02:53,721 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 23 [2019-11-24 06:02:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:53,721 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2019-11-24 06:02:53,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2019-11-24 06:02:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 06:02:53,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:53,723 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] [2019-11-24 06:02:53,724 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1394401220, now seen corresponding path program 1 times [2019-11-24 06:02:53,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:53,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692661302] [2019-11-24 06:02:53,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:53,808 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-24 06:02:53,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692661302] [2019-11-24 06:02:53,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:53,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:53,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596055394] [2019-11-24 06:02:53,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:53,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:53,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:53,813 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 3 states. [2019-11-24 06:02:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:53,993 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2019-11-24 06:02:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:53,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 06:02:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:53,995 INFO L225 Difference]: With dead ends: 306 [2019-11-24 06:02:53,995 INFO L226 Difference]: Without dead ends: 157 [2019-11-24 06:02:53,996 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-24 06:02:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-24 06:02:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-24 06:02:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-24 06:02:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2019-11-24 06:02:54,010 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 23 [2019-11-24 06:02:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:54,010 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2019-11-24 06:02:54,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2019-11-24 06:02:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 06:02:54,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:54,012 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] [2019-11-24 06:02:54,012 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1515910148, now seen corresponding path program 1 times [2019-11-24 06:02:54,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:54,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033311211] [2019-11-24 06:02:54,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:54,047 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-24 06:02:54,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033311211] [2019-11-24 06:02:54,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:54,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762693229] [2019-11-24 06:02:54,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:54,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:54,049 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 3 states. [2019-11-24 06:02:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:54,190 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2019-11-24 06:02:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:54,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 06:02:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:54,192 INFO L225 Difference]: With dead ends: 320 [2019-11-24 06:02:54,192 INFO L226 Difference]: Without dead ends: 165 [2019-11-24 06:02:54,193 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-24 06:02:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-24 06:02:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-24 06:02:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-24 06:02:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2019-11-24 06:02:54,202 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 24 [2019-11-24 06:02:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:54,202 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2019-11-24 06:02:54,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2019-11-24 06:02:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 06:02:54,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:54,204 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] [2019-11-24 06:02:54,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash -369185236, now seen corresponding path program 1 times [2019-11-24 06:02:54,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:54,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384929762] [2019-11-24 06:02:54,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:54,232 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-24 06:02:54,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384929762] [2019-11-24 06:02:54,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:54,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:54,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484995152] [2019-11-24 06:02:54,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:54,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:54,235 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand 3 states. [2019-11-24 06:02:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:54,359 INFO L93 Difference]: Finished difference Result 314 states and 476 transitions. [2019-11-24 06:02:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:54,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 06:02:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:54,362 INFO L225 Difference]: With dead ends: 314 [2019-11-24 06:02:54,362 INFO L226 Difference]: Without dead ends: 159 [2019-11-24 06:02:54,363 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-24 06:02:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-24 06:02:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-24 06:02:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-24 06:02:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2019-11-24 06:02:54,372 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 24 [2019-11-24 06:02:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:54,372 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2019-11-24 06:02:54,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2019-11-24 06:02:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 06:02:54,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:54,374 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] [2019-11-24 06:02:54,374 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1667011611, now seen corresponding path program 1 times [2019-11-24 06:02:54,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:54,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645546612] [2019-11-24 06:02:54,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:54,400 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-24 06:02:54,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645546612] [2019-11-24 06:02:54,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:54,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:54,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565440964] [2019-11-24 06:02:54,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:54,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:54,403 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand 3 states. [2019-11-24 06:02:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:54,514 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2019-11-24 06:02:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:54,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 06:02:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:54,516 INFO L225 Difference]: With dead ends: 320 [2019-11-24 06:02:54,516 INFO L226 Difference]: Without dead ends: 165 [2019-11-24 06:02:54,517 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-24 06:02:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-24 06:02:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-24 06:02:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-24 06:02:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2019-11-24 06:02:54,526 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 25 [2019-11-24 06:02:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:54,527 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2019-11-24 06:02:54,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2019-11-24 06:02:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 06:02:54,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:54,528 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] [2019-11-24 06:02:54,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1480730391, now seen corresponding path program 1 times [2019-11-24 06:02:54,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:54,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139771955] [2019-11-24 06:02:54,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:54,553 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-24 06:02:54,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139771955] [2019-11-24 06:02:54,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:54,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:54,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066155305] [2019-11-24 06:02:54,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:54,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:54,556 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand 3 states. [2019-11-24 06:02:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:54,667 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2019-11-24 06:02:54,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:54,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 06:02:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:54,669 INFO L225 Difference]: With dead ends: 320 [2019-11-24 06:02:54,670 INFO L226 Difference]: Without dead ends: 165 [2019-11-24 06:02:54,670 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-24 06:02:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-24 06:02:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-24 06:02:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-24 06:02:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2019-11-24 06:02:54,693 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 26 [2019-11-24 06:02:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:54,694 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2019-11-24 06:02:54,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2019-11-24 06:02:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 06:02:54,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:54,695 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] [2019-11-24 06:02:54,695 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1189380498, now seen corresponding path program 1 times [2019-11-24 06:02:54,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:54,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927178460] [2019-11-24 06:02:54,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:54,744 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-24 06:02:54,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927178460] [2019-11-24 06:02:54,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:54,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:02:54,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695932742] [2019-11-24 06:02:54,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:02:54,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:54,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:02:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:02:54,749 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand 4 states. [2019-11-24 06:02:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:54,970 INFO L93 Difference]: Finished difference Result 446 states and 659 transitions. [2019-11-24 06:02:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:02:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 06:02:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:54,973 INFO L225 Difference]: With dead ends: 446 [2019-11-24 06:02:54,973 INFO L226 Difference]: Without dead ends: 291 [2019-11-24 06:02:54,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:02:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-24 06:02:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 267. [2019-11-24 06:02:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-24 06:02:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 397 transitions. [2019-11-24 06:02:54,988 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 397 transitions. Word has length 26 [2019-11-24 06:02:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:54,988 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 397 transitions. [2019-11-24 06:02:54,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:02:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 397 transitions. [2019-11-24 06:02:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 06:02:54,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:54,990 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] [2019-11-24 06:02:54,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash 357320297, now seen corresponding path program 1 times [2019-11-24 06:02:54,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:54,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619312346] [2019-11-24 06:02:54,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:55,056 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-24 06:02:55,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619312346] [2019-11-24 06:02:55,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:55,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:55,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245446849] [2019-11-24 06:02:55,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:55,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:55,059 INFO L87 Difference]: Start difference. First operand 267 states and 397 transitions. Second operand 3 states. [2019-11-24 06:02:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:55,242 INFO L93 Difference]: Finished difference Result 612 states and 929 transitions. [2019-11-24 06:02:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:55,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 06:02:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:55,247 INFO L225 Difference]: With dead ends: 612 [2019-11-24 06:02:55,248 INFO L226 Difference]: Without dead ends: 347 [2019-11-24 06:02:55,248 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-24 06:02:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-24 06:02:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 331. [2019-11-24 06:02:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-24 06:02:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2019-11-24 06:02:55,266 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 39 [2019-11-24 06:02:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:55,266 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2019-11-24 06:02:55,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2019-11-24 06:02:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:02:55,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:55,269 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] [2019-11-24 06:02:55,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash 37401672, now seen corresponding path program 1 times [2019-11-24 06:02:55,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:55,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423077093] [2019-11-24 06:02:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:55,321 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-24 06:02:55,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423077093] [2019-11-24 06:02:55,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:55,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:55,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130295327] [2019-11-24 06:02:55,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:55,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:55,324 INFO L87 Difference]: Start difference. First operand 331 states and 507 transitions. Second operand 3 states. [2019-11-24 06:02:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:55,490 INFO L93 Difference]: Finished difference Result 670 states and 1027 transitions. [2019-11-24 06:02:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:55,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 06:02:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:55,494 INFO L225 Difference]: With dead ends: 670 [2019-11-24 06:02:55,494 INFO L226 Difference]: Without dead ends: 341 [2019-11-24 06:02:55,495 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-24 06:02:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-24 06:02:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 332. [2019-11-24 06:02:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-24 06:02:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-11-24 06:02:55,525 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 40 [2019-11-24 06:02:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:55,526 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-11-24 06:02:55,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-11-24 06:02:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 06:02:55,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:55,527 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:02:55,527 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:55,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1642271592, now seen corresponding path program 1 times [2019-11-24 06:02:55,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:55,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556689481] [2019-11-24 06:02:55,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:02:55,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556689481] [2019-11-24 06:02:55,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:55,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:55,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900103654] [2019-11-24 06:02:55,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:55,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:55,557 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2019-11-24 06:02:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:55,713 INFO L93 Difference]: Finished difference Result 710 states and 1087 transitions. [2019-11-24 06:02:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:55,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 06:02:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:55,716 INFO L225 Difference]: With dead ends: 710 [2019-11-24 06:02:55,717 INFO L226 Difference]: Without dead ends: 380 [2019-11-24 06:02:55,718 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-24 06:02:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-24 06:02:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2019-11-24 06:02:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-24 06:02:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2019-11-24 06:02:55,735 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 49 [2019-11-24 06:02:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:55,735 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2019-11-24 06:02:55,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2019-11-24 06:02:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 06:02:55,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:55,736 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:02:55,737 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1949419570, now seen corresponding path program 1 times [2019-11-24 06:02:55,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:55,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948908343] [2019-11-24 06:02:55,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:02:55,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948908343] [2019-11-24 06:02:55,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:55,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:55,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001308804] [2019-11-24 06:02:55,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:55,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:55,777 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 3 states. [2019-11-24 06:02:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:55,945 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2019-11-24 06:02:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:55,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 06:02:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:55,948 INFO L225 Difference]: With dead ends: 791 [2019-11-24 06:02:55,948 INFO L226 Difference]: Without dead ends: 429 [2019-11-24 06:02:55,949 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-24 06:02:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-24 06:02:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2019-11-24 06:02:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-24 06:02:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 649 transitions. [2019-11-24 06:02:55,968 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 649 transitions. Word has length 49 [2019-11-24 06:02:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:55,968 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 649 transitions. [2019-11-24 06:02:55,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 649 transitions. [2019-11-24 06:02:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 06:02:55,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:55,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:55,970 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1558490573, now seen corresponding path program 1 times [2019-11-24 06:02:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:55,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870495722] [2019-11-24 06:02:55,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:02:56,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870495722] [2019-11-24 06:02:56,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:56,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:56,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298130585] [2019-11-24 06:02:56,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:56,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:56,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:56,013 INFO L87 Difference]: Start difference. First operand 427 states and 649 transitions. Second operand 3 states. [2019-11-24 06:02:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:56,167 INFO L93 Difference]: Finished difference Result 860 states and 1309 transitions. [2019-11-24 06:02:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:56,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-24 06:02:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:56,170 INFO L225 Difference]: With dead ends: 860 [2019-11-24 06:02:56,170 INFO L226 Difference]: Without dead ends: 435 [2019-11-24 06:02:56,172 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-24 06:02:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-24 06:02:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2019-11-24 06:02:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-24 06:02:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 645 transitions. [2019-11-24 06:02:56,190 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 645 transitions. Word has length 61 [2019-11-24 06:02:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:56,190 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 645 transitions. [2019-11-24 06:02:56,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 645 transitions. [2019-11-24 06:02:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 06:02:56,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:56,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:56,192 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash 852247642, now seen corresponding path program 1 times [2019-11-24 06:02:56,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:56,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812088722] [2019-11-24 06:02:56,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:02:56,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812088722] [2019-11-24 06:02:56,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:56,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:56,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150176182] [2019-11-24 06:02:56,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:56,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:56,246 INFO L87 Difference]: Start difference. First operand 427 states and 645 transitions. Second operand 3 states. [2019-11-24 06:02:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:56,473 INFO L93 Difference]: Finished difference Result 897 states and 1354 transitions. [2019-11-24 06:02:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:56,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-24 06:02:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:56,477 INFO L225 Difference]: With dead ends: 897 [2019-11-24 06:02:56,477 INFO L226 Difference]: Without dead ends: 472 [2019-11-24 06:02:56,480 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-24 06:02:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-24 06:02:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2019-11-24 06:02:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-24 06:02:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 704 transitions. [2019-11-24 06:02:56,505 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 704 transitions. Word has length 72 [2019-11-24 06:02:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:56,506 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 704 transitions. [2019-11-24 06:02:56,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 704 transitions. [2019-11-24 06:02:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:02:56,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:56,509 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] [2019-11-24 06:02:56,509 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:56,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash -55546437, now seen corresponding path program 1 times [2019-11-24 06:02:56,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:56,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003037461] [2019-11-24 06:02:56,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:56,569 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-24 06:02:56,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003037461] [2019-11-24 06:02:56,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:56,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:56,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362048280] [2019-11-24 06:02:56,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:56,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:56,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:56,575 INFO L87 Difference]: Start difference. First operand 468 states and 704 transitions. Second operand 3 states. [2019-11-24 06:02:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:56,745 INFO L93 Difference]: Finished difference Result 936 states and 1408 transitions. [2019-11-24 06:02:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:56,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:02:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:56,748 INFO L225 Difference]: With dead ends: 936 [2019-11-24 06:02:56,748 INFO L226 Difference]: Without dead ends: 470 [2019-11-24 06:02:56,749 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-24 06:02:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-24 06:02:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-11-24 06:02:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-24 06:02:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2019-11-24 06:02:56,770 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 73 [2019-11-24 06:02:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:56,771 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2019-11-24 06:02:56,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2019-11-24 06:02:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-24 06:02:56,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:56,773 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-24 06:02:56,773 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1900779534, now seen corresponding path program 1 times [2019-11-24 06:02:56,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:56,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851106978] [2019-11-24 06:02:56,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-24 06:02:56,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851106978] [2019-11-24 06:02:56,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:56,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:56,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518753786] [2019-11-24 06:02:56,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:56,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:56,817 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand 3 states. [2019-11-24 06:02:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:56,977 INFO L93 Difference]: Finished difference Result 934 states and 1400 transitions. [2019-11-24 06:02:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:56,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-24 06:02:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:56,980 INFO L225 Difference]: With dead ends: 934 [2019-11-24 06:02:56,981 INFO L226 Difference]: Without dead ends: 468 [2019-11-24 06:02:56,982 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-24 06:02:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-24 06:02:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2019-11-24 06:02:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-24 06:02:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2019-11-24 06:02:57,011 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 78 [2019-11-24 06:02:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:57,011 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2019-11-24 06:02:57,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2019-11-24 06:02:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 06:02:57,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:57,014 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-24 06:02:57,014 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1755033985, now seen corresponding path program 1 times [2019-11-24 06:02:57,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:57,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694723052] [2019-11-24 06:02:57,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-24 06:02:57,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694723052] [2019-11-24 06:02:57,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:57,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:57,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521681791] [2019-11-24 06:02:57,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:57,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:57,074 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand 3 states. [2019-11-24 06:02:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:57,263 INFO L93 Difference]: Finished difference Result 980 states and 1462 transitions. [2019-11-24 06:02:57,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:57,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-24 06:02:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:57,266 INFO L225 Difference]: With dead ends: 980 [2019-11-24 06:02:57,266 INFO L226 Difference]: Without dead ends: 516 [2019-11-24 06:02:57,267 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-24 06:02:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-24 06:02:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 496. [2019-11-24 06:02:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-24 06:02:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 732 transitions. [2019-11-24 06:02:57,291 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 732 transitions. Word has length 85 [2019-11-24 06:02:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:57,291 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 732 transitions. [2019-11-24 06:02:57,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 732 transitions. [2019-11-24 06:02:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-24 06:02:57,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:57,293 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-24 06:02:57,293 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash -885196477, now seen corresponding path program 1 times [2019-11-24 06:02:57,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:57,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468012621] [2019-11-24 06:02:57,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-24 06:02:57,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468012621] [2019-11-24 06:02:57,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:57,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:57,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289536035] [2019-11-24 06:02:57,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:57,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:57,379 INFO L87 Difference]: Start difference. First operand 496 states and 732 transitions. Second operand 3 states. [2019-11-24 06:02:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:57,529 INFO L93 Difference]: Finished difference Result 1000 states and 1478 transitions. [2019-11-24 06:02:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:57,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-24 06:02:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:57,532 INFO L225 Difference]: With dead ends: 1000 [2019-11-24 06:02:57,533 INFO L226 Difference]: Without dead ends: 506 [2019-11-24 06:02:57,536 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-24 06:02:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-11-24 06:02:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 496. [2019-11-24 06:02:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-24 06:02:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 726 transitions. [2019-11-24 06:02:57,561 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 726 transitions. Word has length 86 [2019-11-24 06:02:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:57,561 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 726 transitions. [2019-11-24 06:02:57,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 726 transitions. [2019-11-24 06:02:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-24 06:02:57,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:57,563 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:02:57,563 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1731983446, now seen corresponding path program 1 times [2019-11-24 06:02:57,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:57,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356211608] [2019-11-24 06:02:57,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-24 06:02:57,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356211608] [2019-11-24 06:02:57,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:57,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:57,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947425385] [2019-11-24 06:02:57,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:57,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:57,601 INFO L87 Difference]: Start difference. First operand 496 states and 726 transitions. Second operand 3 states. [2019-11-24 06:02:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:57,783 INFO L93 Difference]: Finished difference Result 1044 states and 1527 transitions. [2019-11-24 06:02:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:57,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-24 06:02:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:57,786 INFO L225 Difference]: With dead ends: 1044 [2019-11-24 06:02:57,787 INFO L226 Difference]: Without dead ends: 550 [2019-11-24 06:02:57,788 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-24 06:02:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-24 06:02:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2019-11-24 06:02:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-11-24 06:02:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 797 transitions. [2019-11-24 06:02:57,812 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 797 transitions. Word has length 90 [2019-11-24 06:02:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:57,813 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 797 transitions. [2019-11-24 06:02:57,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 797 transitions. [2019-11-24 06:02:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-24 06:02:57,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:57,815 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:02:57,815 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:57,815 INFO L82 PathProgramCache]: Analyzing trace with hash 733600939, now seen corresponding path program 1 times [2019-11-24 06:02:57,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:57,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733961809] [2019-11-24 06:02:57,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-24 06:02:57,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733961809] [2019-11-24 06:02:57,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:57,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:57,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142247928] [2019-11-24 06:02:57,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:57,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:57,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:57,848 INFO L87 Difference]: Start difference. First operand 546 states and 797 transitions. Second operand 3 states. [2019-11-24 06:02:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:58,021 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2019-11-24 06:02:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:58,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-24 06:02:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:58,025 INFO L225 Difference]: With dead ends: 1093 [2019-11-24 06:02:58,025 INFO L226 Difference]: Without dead ends: 545 [2019-11-24 06:02:58,026 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-24 06:02:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-11-24 06:02:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2019-11-24 06:02:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-24 06:02:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 791 transitions. [2019-11-24 06:02:58,048 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 791 transitions. Word has length 91 [2019-11-24 06:02:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:58,049 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 791 transitions. [2019-11-24 06:02:58,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 791 transitions. [2019-11-24 06:02:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-24 06:02:58,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:58,051 INFO L410 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:58,051 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1885246774, now seen corresponding path program 1 times [2019-11-24 06:02:58,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:58,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758861666] [2019-11-24 06:02:58,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-24 06:02:58,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758861666] [2019-11-24 06:02:58,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:58,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:58,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512863356] [2019-11-24 06:02:58,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:58,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:58,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:58,086 INFO L87 Difference]: Start difference. First operand 543 states and 791 transitions. Second operand 3 states. [2019-11-24 06:02:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:58,295 INFO L93 Difference]: Finished difference Result 1127 states and 1639 transitions. [2019-11-24 06:02:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:58,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-24 06:02:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:58,299 INFO L225 Difference]: With dead ends: 1127 [2019-11-24 06:02:58,299 INFO L226 Difference]: Without dead ends: 586 [2019-11-24 06:02:58,300 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-24 06:02:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-24 06:02:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-11-24 06:02:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-24 06:02:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 841 transitions. [2019-11-24 06:02:58,324 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 841 transitions. Word has length 103 [2019-11-24 06:02:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:58,325 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 841 transitions. [2019-11-24 06:02:58,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 841 transitions. [2019-11-24 06:02:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-24 06:02:58,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:58,326 INFO L410 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:58,327 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 937544789, now seen corresponding path program 1 times [2019-11-24 06:02:58,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:58,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015262391] [2019-11-24 06:02:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-24 06:02:58,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015262391] [2019-11-24 06:02:58,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:58,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:58,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410216820] [2019-11-24 06:02:58,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:58,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:58,362 INFO L87 Difference]: Start difference. First operand 582 states and 841 transitions. Second operand 3 states. [2019-11-24 06:02:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:58,516 INFO L93 Difference]: Finished difference Result 1164 states and 1682 transitions. [2019-11-24 06:02:58,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:58,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-24 06:02:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:58,519 INFO L225 Difference]: With dead ends: 1164 [2019-11-24 06:02:58,519 INFO L226 Difference]: Without dead ends: 584 [2019-11-24 06:02:58,521 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-24 06:02:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-24 06:02:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2019-11-24 06:02:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-24 06:02:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 836 transitions. [2019-11-24 06:02:58,544 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 836 transitions. Word has length 104 [2019-11-24 06:02:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:58,545 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 836 transitions. [2019-11-24 06:02:58,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 836 transitions. [2019-11-24 06:02:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-24 06:02:58,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:58,546 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:58,547 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:58,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1290691939, now seen corresponding path program 1 times [2019-11-24 06:02:58,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:58,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753033792] [2019-11-24 06:02:58,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-24 06:02:58,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753033792] [2019-11-24 06:02:58,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:58,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:58,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116452949] [2019-11-24 06:02:58,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:58,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:58,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:58,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:58,578 INFO L87 Difference]: Start difference. First operand 582 states and 836 transitions. Second operand 3 states. [2019-11-24 06:02:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:58,722 INFO L93 Difference]: Finished difference Result 1198 states and 1720 transitions. [2019-11-24 06:02:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:58,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-24 06:02:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:58,725 INFO L225 Difference]: With dead ends: 1198 [2019-11-24 06:02:58,725 INFO L226 Difference]: Without dead ends: 618 [2019-11-24 06:02:58,727 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-24 06:02:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-24 06:02:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2019-11-24 06:02:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-24 06:02:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 867 transitions. [2019-11-24 06:02:58,753 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 867 transitions. Word has length 106 [2019-11-24 06:02:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:58,753 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 867 transitions. [2019-11-24 06:02:58,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 867 transitions. [2019-11-24 06:02:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-24 06:02:58,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:58,755 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:58,756 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1015508545, now seen corresponding path program 1 times [2019-11-24 06:02:58,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:58,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733807933] [2019-11-24 06:02:58,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-24 06:02:58,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733807933] [2019-11-24 06:02:58,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:58,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:58,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837247942] [2019-11-24 06:02:58,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:58,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:58,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:58,791 INFO L87 Difference]: Start difference. First operand 610 states and 867 transitions. Second operand 3 states. [2019-11-24 06:02:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:58,964 INFO L93 Difference]: Finished difference Result 1222 states and 1737 transitions. [2019-11-24 06:02:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:58,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-24 06:02:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:58,969 INFO L225 Difference]: With dead ends: 1222 [2019-11-24 06:02:58,970 INFO L226 Difference]: Without dead ends: 614 [2019-11-24 06:02:58,971 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-24 06:02:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-24 06:02:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2019-11-24 06:02:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-24 06:02:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 858 transitions. [2019-11-24 06:02:59,004 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 858 transitions. Word has length 107 [2019-11-24 06:02:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:59,004 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 858 transitions. [2019-11-24 06:02:59,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 858 transitions. [2019-11-24 06:02:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-24 06:02:59,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:59,006 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-11-24 06:02:59,007 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -583880554, now seen corresponding path program 1 times [2019-11-24 06:02:59,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:59,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040993418] [2019-11-24 06:02:59,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-24 06:02:59,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040993418] [2019-11-24 06:02:59,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:59,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417835538] [2019-11-24 06:02:59,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:59,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:59,071 INFO L87 Difference]: Start difference. First operand 610 states and 858 transitions. Second operand 3 states. [2019-11-24 06:02:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:59,211 INFO L93 Difference]: Finished difference Result 1248 states and 1754 transitions. [2019-11-24 06:02:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:59,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-24 06:02:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:59,214 INFO L225 Difference]: With dead ends: 1248 [2019-11-24 06:02:59,214 INFO L226 Difference]: Without dead ends: 640 [2019-11-24 06:02:59,216 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-24 06:02:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-24 06:02:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-11-24 06:02:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-11-24 06:02:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 884 transitions. [2019-11-24 06:02:59,245 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 884 transitions. Word has length 124 [2019-11-24 06:02:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:59,245 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 884 transitions. [2019-11-24 06:02:59,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 884 transitions. [2019-11-24 06:02:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-24 06:02:59,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:59,248 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-24 06:02:59,248 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2014192274, now seen corresponding path program 1 times [2019-11-24 06:02:59,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:59,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137206631] [2019-11-24 06:02:59,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-24 06:02:59,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137206631] [2019-11-24 06:02:59,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:59,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:59,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112887015] [2019-11-24 06:02:59,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:59,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:59,281 INFO L87 Difference]: Start difference. First operand 636 states and 884 transitions. Second operand 3 states. [2019-11-24 06:02:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:59,423 INFO L93 Difference]: Finished difference Result 1272 states and 1768 transitions. [2019-11-24 06:02:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:59,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-24 06:02:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:59,426 INFO L225 Difference]: With dead ends: 1272 [2019-11-24 06:02:59,426 INFO L226 Difference]: Without dead ends: 638 [2019-11-24 06:02:59,428 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-24 06:02:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-24 06:02:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-11-24 06:02:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-11-24 06:02:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 874 transitions. [2019-11-24 06:02:59,453 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 874 transitions. Word has length 125 [2019-11-24 06:02:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:59,453 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 874 transitions. [2019-11-24 06:02:59,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 874 transitions. [2019-11-24 06:02:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-24 06:02:59,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:59,455 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-24 06:02:59,456 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:59,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:59,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1234829430, now seen corresponding path program 1 times [2019-11-24 06:02:59,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:59,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448069005] [2019-11-24 06:02:59,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-24 06:02:59,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448069005] [2019-11-24 06:02:59,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:59,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:59,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436247112] [2019-11-24 06:02:59,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:59,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:59,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:59,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:59,497 INFO L87 Difference]: Start difference. First operand 636 states and 874 transitions. Second operand 3 states. [2019-11-24 06:02:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:59,652 INFO L93 Difference]: Finished difference Result 1321 states and 1809 transitions. [2019-11-24 06:02:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:59,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-24 06:02:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:59,656 INFO L225 Difference]: With dead ends: 1321 [2019-11-24 06:02:59,656 INFO L226 Difference]: Without dead ends: 687 [2019-11-24 06:02:59,657 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-24 06:02:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-24 06:02:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2019-11-24 06:02:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-11-24 06:02:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 928 transitions. [2019-11-24 06:02:59,683 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 928 transitions. Word has length 129 [2019-11-24 06:02:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:59,684 INFO L462 AbstractCegarLoop]: Abstraction has 681 states and 928 transitions. [2019-11-24 06:02:59,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 928 transitions. [2019-11-24 06:02:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-24 06:02:59,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:59,686 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-24 06:02:59,686 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -768067575, now seen corresponding path program 1 times [2019-11-24 06:02:59,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:59,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513099503] [2019-11-24 06:02:59,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-24 06:02:59,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513099503] [2019-11-24 06:02:59,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:59,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:02:59,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291100060] [2019-11-24 06:02:59,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:59,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:59,736 INFO L87 Difference]: Start difference. First operand 681 states and 928 transitions. Second operand 3 states. [2019-11-24 06:02:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:59,942 INFO L93 Difference]: Finished difference Result 1363 states and 1857 transitions. [2019-11-24 06:02:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-24 06:02:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:59,945 INFO L225 Difference]: With dead ends: 1363 [2019-11-24 06:02:59,945 INFO L226 Difference]: Without dead ends: 668 [2019-11-24 06:02:59,947 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-24 06:02:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-11-24 06:02:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 665. [2019-11-24 06:02:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-24 06:02:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 905 transitions. [2019-11-24 06:02:59,978 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 905 transitions. Word has length 130 [2019-11-24 06:02:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:59,978 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 905 transitions. [2019-11-24 06:02:59,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 905 transitions. [2019-11-24 06:02:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 06:02:59,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:59,980 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, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:02:59,981 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1248036782, now seen corresponding path program 1 times [2019-11-24 06:02:59,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:59,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226895277] [2019-11-24 06:02:59,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-24 06:03:00,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226895277] [2019-11-24 06:03:00,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:00,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:00,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425151479] [2019-11-24 06:03:00,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:00,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:00,031 INFO L87 Difference]: Start difference. First operand 665 states and 905 transitions. Second operand 3 states. [2019-11-24 06:03:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:00,188 INFO L93 Difference]: Finished difference Result 1332 states and 1813 transitions. [2019-11-24 06:03:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:00,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-24 06:03:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:00,191 INFO L225 Difference]: With dead ends: 1332 [2019-11-24 06:03:00,191 INFO L226 Difference]: Without dead ends: 669 [2019-11-24 06:03:00,193 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-24 06:03:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-11-24 06:03:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2019-11-24 06:03:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-24 06:03:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 898 transitions. [2019-11-24 06:03:00,219 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 898 transitions. Word has length 134 [2019-11-24 06:03:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:00,220 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 898 transitions. [2019-11-24 06:03:00,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 898 transitions. [2019-11-24 06:03:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-24 06:03:00,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:00,222 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, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:00,222 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2121917619, now seen corresponding path program 1 times [2019-11-24 06:03:00,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:00,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276724298] [2019-11-24 06:03:00,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-24 06:03:00,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276724298] [2019-11-24 06:03:00,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:00,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:00,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590604382] [2019-11-24 06:03:00,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:00,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:00,260 INFO L87 Difference]: Start difference. First operand 665 states and 898 transitions. Second operand 3 states. [2019-11-24 06:03:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:00,417 INFO L93 Difference]: Finished difference Result 1320 states and 1782 transitions. [2019-11-24 06:03:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:00,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-24 06:03:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:00,421 INFO L225 Difference]: With dead ends: 1320 [2019-11-24 06:03:00,421 INFO L226 Difference]: Without dead ends: 640 [2019-11-24 06:03:00,422 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-24 06:03:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-24 06:03:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-11-24 06:03:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-11-24 06:03:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 853 transitions. [2019-11-24 06:03:00,448 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 853 transitions. Word has length 135 [2019-11-24 06:03:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:00,448 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 853 transitions. [2019-11-24 06:03:00,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 853 transitions. [2019-11-24 06:03:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-24 06:03:00,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:00,450 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-24 06:03:00,451 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1878713645, now seen corresponding path program 1 times [2019-11-24 06:03:00,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:00,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74851003] [2019-11-24 06:03:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-24 06:03:00,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74851003] [2019-11-24 06:03:00,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:00,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:00,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092727550] [2019-11-24 06:03:00,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:00,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:00,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:00,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:00,505 INFO L87 Difference]: Start difference. First operand 636 states and 853 transitions. Second operand 3 states. [2019-11-24 06:03:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:00,571 INFO L93 Difference]: Finished difference Result 1885 states and 2523 transitions. [2019-11-24 06:03:00,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:00,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-24 06:03:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:00,596 INFO L225 Difference]: With dead ends: 1885 [2019-11-24 06:03:00,596 INFO L226 Difference]: Without dead ends: 1251 [2019-11-24 06:03:00,599 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-24 06:03:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-11-24 06:03:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2019-11-24 06:03:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-11-24 06:03:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1668 transitions. [2019-11-24 06:03:00,654 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1668 transitions. Word has length 139 [2019-11-24 06:03:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:00,654 INFO L462 AbstractCegarLoop]: Abstraction has 1249 states and 1668 transitions. [2019-11-24 06:03:00,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1668 transitions. [2019-11-24 06:03:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-24 06:03:00,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:00,656 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-24 06:03:00,656 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash -831110033, now seen corresponding path program 1 times [2019-11-24 06:03:00,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:00,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114736133] [2019-11-24 06:03:00,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:03:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:03:00,852 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:03:00,852 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:03:00,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:03:00 BoogieIcfgContainer [2019-11-24 06:03:00,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:03:00,973 INFO L168 Benchmark]: Toolchain (without parser) took 10547.60 ms. Allocated memory was 142.6 MB in the beginning and 450.9 MB in the end (delta: 308.3 MB). Free memory was 100.3 MB in the beginning and 353.0 MB in the end (delta: -252.7 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,975 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.16 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 174.4 MB in the end (delta: -74.3 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 199.8 MB. Free memory was 174.4 MB in the beginning and 171.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,977 INFO L168 Benchmark]: Boogie Preprocessor took 42.95 ms. Allocated memory is still 199.8 MB. Free memory was 171.1 MB in the beginning and 168.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,977 INFO L168 Benchmark]: RCFGBuilder took 1349.20 ms. Allocated memory was 199.8 MB in the beginning and 228.1 MB in the end (delta: 28.3 MB). Free memory was 168.2 MB in the beginning and 185.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 93.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,977 INFO L168 Benchmark]: TraceAbstraction took 8536.53 ms. Allocated memory was 228.1 MB in the beginning and 450.9 MB in the end (delta: 222.8 MB). Free memory was 184.4 MB in the beginning and 353.0 MB in the end (delta: -168.6 MB). Peak memory consumption was 54.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:00,979 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.22 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 557.16 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 174.4 MB in the end (delta: -74.3 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 199.8 MB. Free memory was 174.4 MB in the beginning and 171.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.95 ms. Allocated memory is still 199.8 MB. Free memory was 171.1 MB in the beginning and 168.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1349.20 ms. Allocated memory was 199.8 MB in the beginning and 228.1 MB in the end (delta: 28.3 MB). Free memory was 168.2 MB in the beginning and 185.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 93.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8536.53 ms. Allocated memory was 228.1 MB in the beginning and 450.9 MB in the end (delta: 222.8 MB). Free memory was 184.4 MB in the beginning and 353.0 MB in the end (delta: -168.6 MB). Peak memory consumption was 54.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND TRUE tmp___1 + 12288 [L91] COND TRUE tmp___2 + 16384 [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3969 SDtfs, 4395 SDslu, 816 SDs, 0 SdLazy, 2772 SolverSat, 1263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 198 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2332 ConstructedInterpolants, 0 QuantifiedInterpolants, 394525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 1895/1895 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 incorrect! Received shutdown request...