/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/product-lines/elevator_spec1_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:38:15,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:38:15,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:38:15,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:38:15,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:38:15,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:38:15,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:38:15,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:38:15,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:38:15,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:38:15,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:38:15,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:38:15,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:38:15,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:38:15,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:38:15,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:38:15,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:38:15,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:38:15,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:38:15,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:38:15,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:38:15,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:38:15,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:38:15,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:38:15,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:38:15,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:38:15,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:38:15,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:38:15,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:38:15,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:38:15,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:38:15,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:38:15,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:38:15,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:38:15,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:38:15,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:38:15,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:38:15,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:38:15,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:38:15,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:38:15,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:38:15,232 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 04:38:15,266 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:38:15,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:38:15,267 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:38:15,267 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:38:15,268 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:38:15,268 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:38:15,268 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:38:15,268 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:38:15,268 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:38:15,269 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:38:15,269 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:38:15,269 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:38:15,269 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:38:15,270 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:38:15,270 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:38:15,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:38:15,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:38:15,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:38:15,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:38:15,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:38:15,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:38:15,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:38:15,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:38:15,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:38:15,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:38:15,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:38:15,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:38:15,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:38:15,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:38:15,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:38:15,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:38:15,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:38:15,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:38:15,274 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:38:15,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:38:15,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:38:15,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:38:15,275 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:38:15,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:38:15,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:38:15,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:38:15,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:38:15,596 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:38:15,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product21.cil.c [2019-11-24 04:38:15,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39c3bbea/22790d28f822474a9fa91beb459c28a4/FLAG62d2abb56 [2019-11-24 04:38:16,359 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:38:16,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product21.cil.c [2019-11-24 04:38:16,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39c3bbea/22790d28f822474a9fa91beb459c28a4/FLAG62d2abb56 [2019-11-24 04:38:16,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39c3bbea/22790d28f822474a9fa91beb459c28a4 [2019-11-24 04:38:16,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:38:16,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:38:16,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:16,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:38:16,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:38:16,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:16" (1/1) ... [2019-11-24 04:38:16,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac7d68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:16, skipping insertion in model container [2019-11-24 04:38:16,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:16" (1/1) ... [2019-11-24 04:38:16,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:38:16,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:38:17,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:17,360 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:38:17,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:17,630 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:38:17,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17 WrapperNode [2019-11-24 04:38:17,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:17,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:17,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:38:17,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:38:17,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:17,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:18,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:38:18,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:38:18,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:38:18,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (1/1) ... [2019-11-24 04:38:18,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:38:18,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:38:18,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:38:18,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:38:18,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (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 04:38:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:38:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:38:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:38:18,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:38:59,262 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:38:59,264 INFO L284 CfgBuilder]: Removed 761 assume(true) statements. [2019-11-24 04:38:59,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:38:59 BoogieIcfgContainer [2019-11-24 04:38:59,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:38:59,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:38:59,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:38:59,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:38:59,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:38:16" (1/3) ... [2019-11-24 04:38:59,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71147556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:38:59, skipping insertion in model container [2019-11-24 04:38:59,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:17" (2/3) ... [2019-11-24 04:38:59,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71147556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:38:59, skipping insertion in model container [2019-11-24 04:38:59,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:38:59" (3/3) ... [2019-11-24 04:38:59,287 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product21.cil.c [2019-11-24 04:38:59,301 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:38:59,313 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:38:59,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:38:59,394 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:38:59,394 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:38:59,394 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:38:59,395 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:38:59,395 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:38:59,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:38:59,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:38:59,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:38:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states. [2019-11-24 04:38:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:38:59,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:59,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:59,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash -390040776, now seen corresponding path program 1 times [2019-11-24 04:38:59,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:59,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523497775] [2019-11-24 04:38:59,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:00,425 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 04:39:00,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523497775] [2019-11-24 04:39:00,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:00,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:39:00,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369978978] [2019-11-24 04:39:00,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:00,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:00,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:00,457 INFO L87 Difference]: Start difference. First operand 1233 states. Second operand 5 states. [2019-11-24 04:39:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:01,312 INFO L93 Difference]: Finished difference Result 2259 states and 4301 transitions. [2019-11-24 04:39:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:01,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:39:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:01,349 INFO L225 Difference]: With dead ends: 2259 [2019-11-24 04:39:01,349 INFO L226 Difference]: Without dead ends: 1610 [2019-11-24 04:39:01,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:39:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-11-24 04:39:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1241. [2019-11-24 04:39:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-24 04:39:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2383 transitions. [2019-11-24 04:39:01,497 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2383 transitions. Word has length 17 [2019-11-24 04:39:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:01,498 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2383 transitions. [2019-11-24 04:39:01,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2383 transitions. [2019-11-24 04:39:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:39:01,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:01,501 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 04:39:01,502 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash -442618356, now seen corresponding path program 1 times [2019-11-24 04:39:01,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:01,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234091929] [2019-11-24 04:39:01,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:01,612 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 04:39:01,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234091929] [2019-11-24 04:39:01,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:01,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:39:01,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599047528] [2019-11-24 04:39:01,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:01,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:01,616 INFO L87 Difference]: Start difference. First operand 1241 states and 2383 transitions. Second operand 3 states. [2019-11-24 04:39:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:02,569 INFO L93 Difference]: Finished difference Result 2498 states and 4769 transitions. [2019-11-24 04:39:02,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:02,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:39:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:02,581 INFO L225 Difference]: With dead ends: 2498 [2019-11-24 04:39:02,581 INFO L226 Difference]: Without dead ends: 1501 [2019-11-24 04:39:02,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 04:39:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-24 04:39:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1473. [2019-11-24 04:39:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-11-24 04:39:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2702 transitions. [2019-11-24 04:39:02,628 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2702 transitions. Word has length 21 [2019-11-24 04:39:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:02,629 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 2702 transitions. [2019-11-24 04:39:02,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2702 transitions. [2019-11-24 04:39:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:39:02,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:02,632 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 04:39:02,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1208292773, now seen corresponding path program 1 times [2019-11-24 04:39:02,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:02,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533890061] [2019-11-24 04:39:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:02,800 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 04:39:02,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533890061] [2019-11-24 04:39:02,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:02,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:02,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229556143] [2019-11-24 04:39:02,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:02,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:02,803 INFO L87 Difference]: Start difference. First operand 1473 states and 2702 transitions. Second operand 5 states. [2019-11-24 04:39:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:03,278 INFO L93 Difference]: Finished difference Result 3303 states and 6080 transitions. [2019-11-24 04:39:03,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:03,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:39:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:03,294 INFO L225 Difference]: With dead ends: 3303 [2019-11-24 04:39:03,294 INFO L226 Difference]: Without dead ends: 2594 [2019-11-24 04:39:03,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2019-11-24 04:39:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 1477. [2019-11-24 04:39:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-11-24 04:39:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2707 transitions. [2019-11-24 04:39:03,363 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2707 transitions. Word has length 23 [2019-11-24 04:39:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:03,363 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 2707 transitions. [2019-11-24 04:39:03,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2707 transitions. [2019-11-24 04:39:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:39:03,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:03,365 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 04:39:03,366 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:03,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash -86806630, now seen corresponding path program 1 times [2019-11-24 04:39:03,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:03,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702397287] [2019-11-24 04:39:03,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:03,545 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 04:39:03,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702397287] [2019-11-24 04:39:03,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:03,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:39:03,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512935085] [2019-11-24 04:39:03,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:03,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:03,547 INFO L87 Difference]: Start difference. First operand 1477 states and 2707 transitions. Second operand 6 states. [2019-11-24 04:39:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:04,341 INFO L93 Difference]: Finished difference Result 4177 states and 7671 transitions. [2019-11-24 04:39:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 04:39:04,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-24 04:39:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:04,360 INFO L225 Difference]: With dead ends: 4177 [2019-11-24 04:39:04,360 INFO L226 Difference]: Without dead ends: 3031 [2019-11-24 04:39:04,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-24 04:39:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2019-11-24 04:39:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 1416. [2019-11-24 04:39:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-24 04:39:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2600 transitions. [2019-11-24 04:39:04,436 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2600 transitions. Word has length 24 [2019-11-24 04:39:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:04,437 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2600 transitions. [2019-11-24 04:39:04,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2600 transitions. [2019-11-24 04:39:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:39:04,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:04,439 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 04:39:04,439 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:04,440 INFO L82 PathProgramCache]: Analyzing trace with hash -931185908, now seen corresponding path program 1 times [2019-11-24 04:39:04,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:04,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104063810] [2019-11-24 04:39:04,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:04,573 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 04:39:04,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104063810] [2019-11-24 04:39:04,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:04,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:04,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038846364] [2019-11-24 04:39:04,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:04,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:04,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:04,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:04,575 INFO L87 Difference]: Start difference. First operand 1416 states and 2600 transitions. Second operand 5 states. [2019-11-24 04:39:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:04,831 INFO L93 Difference]: Finished difference Result 2485 states and 4565 transitions. [2019-11-24 04:39:04,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:04,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 04:39:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:04,852 INFO L225 Difference]: With dead ends: 2485 [2019-11-24 04:39:04,852 INFO L226 Difference]: Without dead ends: 2470 [2019-11-24 04:39:04,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-24 04:39:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1420. [2019-11-24 04:39:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-11-24 04:39:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2604 transitions. [2019-11-24 04:39:04,954 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2604 transitions. Word has length 24 [2019-11-24 04:39:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:04,955 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 2604 transitions. [2019-11-24 04:39:04,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2604 transitions. [2019-11-24 04:39:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:39:04,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:04,958 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 04:39:04,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1433479054, now seen corresponding path program 1 times [2019-11-24 04:39:04,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:04,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439683683] [2019-11-24 04:39:04,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:05,096 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 04:39:05,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439683683] [2019-11-24 04:39:05,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:05,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:05,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094331089] [2019-11-24 04:39:05,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:05,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:05,100 INFO L87 Difference]: Start difference. First operand 1420 states and 2604 transitions. Second operand 3 states. [2019-11-24 04:39:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:05,190 INFO L93 Difference]: Finished difference Result 1435 states and 2618 transitions. [2019-11-24 04:39:05,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:05,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:39:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:05,201 INFO L225 Difference]: With dead ends: 1435 [2019-11-24 04:39:05,201 INFO L226 Difference]: Without dead ends: 1420 [2019-11-24 04:39:05,202 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 04:39:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2019-11-24 04:39:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2019-11-24 04:39:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-11-24 04:39:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2602 transitions. [2019-11-24 04:39:05,442 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2602 transitions. Word has length 25 [2019-11-24 04:39:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:05,443 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 2602 transitions. [2019-11-24 04:39:05,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2602 transitions. [2019-11-24 04:39:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:39:05,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:05,450 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 04:39:05,450 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1833528623, now seen corresponding path program 1 times [2019-11-24 04:39:05,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:05,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839173245] [2019-11-24 04:39:05,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:05,668 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 04:39:05,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839173245] [2019-11-24 04:39:05,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:05,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:05,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113351641] [2019-11-24 04:39:05,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:05,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:05,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:05,671 INFO L87 Difference]: Start difference. First operand 1420 states and 2602 transitions. Second operand 4 states. [2019-11-24 04:39:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:05,793 INFO L93 Difference]: Finished difference Result 2491 states and 4579 transitions. [2019-11-24 04:39:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:05,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 04:39:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:05,802 INFO L225 Difference]: With dead ends: 2491 [2019-11-24 04:39:05,802 INFO L226 Difference]: Without dead ends: 1413 [2019-11-24 04:39:05,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-11-24 04:39:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1410. [2019-11-24 04:39:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-11-24 04:39:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2583 transitions. [2019-11-24 04:39:05,880 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2583 transitions. Word has length 26 [2019-11-24 04:39:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:05,882 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 2583 transitions. [2019-11-24 04:39:05,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2583 transitions. [2019-11-24 04:39:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:39:05,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:05,886 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] [2019-11-24 04:39:05,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1004835039, now seen corresponding path program 1 times [2019-11-24 04:39:05,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:05,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799942721] [2019-11-24 04:39:05,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,010 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 04:39:06,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799942721] [2019-11-24 04:39:06,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:06,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200639462] [2019-11-24 04:39:06,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:06,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:06,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:06,012 INFO L87 Difference]: Start difference. First operand 1410 states and 2583 transitions. Second operand 3 states. [2019-11-24 04:39:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,221 INFO L93 Difference]: Finished difference Result 3509 states and 6472 transitions. [2019-11-24 04:39:06,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:06,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 04:39:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,241 INFO L225 Difference]: With dead ends: 3509 [2019-11-24 04:39:06,241 INFO L226 Difference]: Without dead ends: 2463 [2019-11-24 04:39:06,244 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 04:39:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2019-11-24 04:39:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2463. [2019-11-24 04:39:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-11-24 04:39:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4534 transitions. [2019-11-24 04:39:06,418 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4534 transitions. Word has length 27 [2019-11-24 04:39:06,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,419 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 4534 transitions. [2019-11-24 04:39:06,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4534 transitions. [2019-11-24 04:39:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:39:06,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,421 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] [2019-11-24 04:39:06,422 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1085137720, now seen corresponding path program 1 times [2019-11-24 04:39:06,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581957108] [2019-11-24 04:39:06,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,904 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 04:39:06,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581957108] [2019-11-24 04:39:06,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:06,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113053671] [2019-11-24 04:39:06,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:06,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:06,909 INFO L87 Difference]: Start difference. First operand 2463 states and 4534 transitions. Second operand 4 states. [2019-11-24 04:39:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,194 INFO L93 Difference]: Finished difference Result 4511 states and 8309 transitions. [2019-11-24 04:39:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:08,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 04:39:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,212 INFO L225 Difference]: With dead ends: 4511 [2019-11-24 04:39:08,212 INFO L226 Difference]: Without dead ends: 3047 [2019-11-24 04:39:08,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 04:39:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2019-11-24 04:39:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 2463. [2019-11-24 04:39:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-11-24 04:39:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4519 transitions. [2019-11-24 04:39:08,425 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4519 transitions. Word has length 28 [2019-11-24 04:39:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:08,425 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 4519 transitions. [2019-11-24 04:39:08,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4519 transitions. [2019-11-24 04:39:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:39:08,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:08,429 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] [2019-11-24 04:39:08,429 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash 832857443, now seen corresponding path program 1 times [2019-11-24 04:39:08,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:08,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303218631] [2019-11-24 04:39:08,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:08,716 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 04:39:08,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303218631] [2019-11-24 04:39:08,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:08,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:08,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062231928] [2019-11-24 04:39:08,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:08,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:08,719 INFO L87 Difference]: Start difference. First operand 2463 states and 4519 transitions. Second operand 5 states. [2019-11-24 04:39:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:09,421 INFO L93 Difference]: Finished difference Result 4304 states and 7886 transitions. [2019-11-24 04:39:09,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:09,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:39:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:09,474 INFO L225 Difference]: With dead ends: 4304 [2019-11-24 04:39:09,477 INFO L226 Difference]: Without dead ends: 3598 [2019-11-24 04:39:09,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2019-11-24 04:39:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 2468. [2019-11-24 04:39:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-11-24 04:39:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 4526 transitions. [2019-11-24 04:39:09,707 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 4526 transitions. Word has length 28 [2019-11-24 04:39:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:09,707 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 4526 transitions. [2019-11-24 04:39:09,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 4526 transitions. [2019-11-24 04:39:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:39:09,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:09,710 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] [2019-11-24 04:39:09,711 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash -943614139, now seen corresponding path program 1 times [2019-11-24 04:39:09,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:09,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807140921] [2019-11-24 04:39:09,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:09,837 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 04:39:09,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807140921] [2019-11-24 04:39:09,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:09,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:09,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539320808] [2019-11-24 04:39:09,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:09,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:09,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:09,840 INFO L87 Difference]: Start difference. First operand 2468 states and 4526 transitions. Second operand 5 states. [2019-11-24 04:39:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:10,817 INFO L93 Difference]: Finished difference Result 6038 states and 11099 transitions. [2019-11-24 04:39:10,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:10,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 04:39:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:10,832 INFO L225 Difference]: With dead ends: 6038 [2019-11-24 04:39:10,833 INFO L226 Difference]: Without dead ends: 4627 [2019-11-24 04:39:10,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2019-11-24 04:39:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 2482. [2019-11-24 04:39:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-11-24 04:39:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 4544 transitions. [2019-11-24 04:39:11,031 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 4544 transitions. Word has length 28 [2019-11-24 04:39:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:11,031 INFO L462 AbstractCegarLoop]: Abstraction has 2482 states and 4544 transitions. [2019-11-24 04:39:11,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 4544 transitions. [2019-11-24 04:39:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:39:11,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:11,033 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] [2019-11-24 04:39:11,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1166698718, now seen corresponding path program 1 times [2019-11-24 04:39:11,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:11,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239476776] [2019-11-24 04:39:11,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:11,390 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 04:39:11,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239476776] [2019-11-24 04:39:11,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:11,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:39:11,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061010420] [2019-11-24 04:39:11,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:39:11,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:39:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:39:11,393 INFO L87 Difference]: Start difference. First operand 2482 states and 4544 transitions. Second operand 9 states. [2019-11-24 04:39:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:18,172 INFO L93 Difference]: Finished difference Result 10962 states and 20176 transitions. [2019-11-24 04:39:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-24 04:39:18,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-24 04:39:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:18,193 INFO L225 Difference]: With dead ends: 10962 [2019-11-24 04:39:18,193 INFO L226 Difference]: Without dead ends: 7524 [2019-11-24 04:39:18,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:39:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2019-11-24 04:39:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 3921. [2019-11-24 04:39:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3921 states. [2019-11-24 04:39:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 7156 transitions. [2019-11-24 04:39:18,663 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 7156 transitions. Word has length 28 [2019-11-24 04:39:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:18,663 INFO L462 AbstractCegarLoop]: Abstraction has 3921 states and 7156 transitions. [2019-11-24 04:39:18,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:39:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 7156 transitions. [2019-11-24 04:39:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:39:18,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:18,666 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] [2019-11-24 04:39:18,667 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1280245989, now seen corresponding path program 1 times [2019-11-24 04:39:18,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:18,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993419156] [2019-11-24 04:39:18,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:18,837 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 04:39:18,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993419156] [2019-11-24 04:39:18,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:18,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:18,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893917699] [2019-11-24 04:39:18,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:18,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:18,839 INFO L87 Difference]: Start difference. First operand 3921 states and 7156 transitions. Second operand 3 states. [2019-11-24 04:39:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:20,423 INFO L93 Difference]: Finished difference Result 10256 states and 18633 transitions. [2019-11-24 04:39:20,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:20,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:39:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:20,438 INFO L225 Difference]: With dead ends: 10256 [2019-11-24 04:39:20,438 INFO L226 Difference]: Without dead ends: 6522 [2019-11-24 04:39:20,445 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 04:39:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2019-11-24 04:39:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 3821. [2019-11-24 04:39:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3821 states. [2019-11-24 04:39:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6906 transitions. [2019-11-24 04:39:20,841 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6906 transitions. Word has length 35 [2019-11-24 04:39:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:20,842 INFO L462 AbstractCegarLoop]: Abstraction has 3821 states and 6906 transitions. [2019-11-24 04:39:20,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6906 transitions. [2019-11-24 04:39:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:39:20,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:20,846 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] [2019-11-24 04:39:20,846 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash -528725979, now seen corresponding path program 1 times [2019-11-24 04:39:20,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:20,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864619899] [2019-11-24 04:39:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:21,028 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 04:39:21,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864619899] [2019-11-24 04:39:21,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:21,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:21,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630686269] [2019-11-24 04:39:21,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:21,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:21,030 INFO L87 Difference]: Start difference. First operand 3821 states and 6906 transitions. Second operand 3 states. [2019-11-24 04:39:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:22,351 INFO L93 Difference]: Finished difference Result 10054 states and 18146 transitions. [2019-11-24 04:39:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:22,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:39:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:22,364 INFO L225 Difference]: With dead ends: 10054 [2019-11-24 04:39:22,364 INFO L226 Difference]: Without dead ends: 6442 [2019-11-24 04:39:22,371 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 04:39:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2019-11-24 04:39:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 3746. [2019-11-24 04:39:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3746 states. [2019-11-24 04:39:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 6681 transitions. [2019-11-24 04:39:22,929 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 6681 transitions. Word has length 36 [2019-11-24 04:39:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:22,929 INFO L462 AbstractCegarLoop]: Abstraction has 3746 states and 6681 transitions. [2019-11-24 04:39:22,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 6681 transitions. [2019-11-24 04:39:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:39:22,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:22,932 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] [2019-11-24 04:39:22,933 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -388664630, now seen corresponding path program 1 times [2019-11-24 04:39:22,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:22,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744838544] [2019-11-24 04:39:22,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:23,164 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 04:39:23,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744838544] [2019-11-24 04:39:23,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:23,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:23,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337038921] [2019-11-24 04:39:23,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:23,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:23,167 INFO L87 Difference]: Start difference. First operand 3746 states and 6681 transitions. Second operand 3 states. [2019-11-24 04:39:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:24,375 INFO L93 Difference]: Finished difference Result 9897 states and 17704 transitions. [2019-11-24 04:39:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:24,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 04:39:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:24,387 INFO L225 Difference]: With dead ends: 9897 [2019-11-24 04:39:24,387 INFO L226 Difference]: Without dead ends: 6387 [2019-11-24 04:39:24,394 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 04:39:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2019-11-24 04:39:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 3696. [2019-11-24 04:39:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3696 states. [2019-11-24 04:39:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 6481 transitions. [2019-11-24 04:39:24,770 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 6481 transitions. Word has length 38 [2019-11-24 04:39:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:24,771 INFO L462 AbstractCegarLoop]: Abstraction has 3696 states and 6481 transitions. [2019-11-24 04:39:24,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 6481 transitions. [2019-11-24 04:39:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:39:24,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:24,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:24,775 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash -219573157, now seen corresponding path program 1 times [2019-11-24 04:39:24,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:24,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037095337] [2019-11-24 04:39:24,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:24,971 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 04:39:24,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037095337] [2019-11-24 04:39:24,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:24,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:24,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545958502] [2019-11-24 04:39:24,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:24,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:24,974 INFO L87 Difference]: Start difference. First operand 3696 states and 6481 transitions. Second operand 3 states.