/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/email_spec0_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:50:14,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:50:14,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:50:14,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:50:14,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:50:14,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:50:14,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:50:14,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:50:14,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:50:14,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:50:14,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:50:14,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:50:14,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:50:14,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:50:14,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:50:14,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:50:14,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:50:14,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:50:14,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:50:14,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:50:14,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:50:14,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:50:14,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:50:14,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:50:14,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:50:14,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:50:14,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:50:14,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:50:14,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:50:14,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:50:14,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:50:14,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:50:14,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:50:14,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:50:14,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:50:14,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:50:14,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:50:14,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:50:14,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:50:14,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:50:14,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:50:14,460 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:50:14,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:50:14,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:50:14,476 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:50:14,476 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:50:14,477 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:50:14,477 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:50:14,477 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:50:14,477 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:50:14,477 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:50:14,478 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:50:14,478 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:50:14,478 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:50:14,478 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:50:14,479 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:50:14,479 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:50:14,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:50:14,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:50:14,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:50:14,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:50:14,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:50:14,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:50:14,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:50:14,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:50:14,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:50:14,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:50:14,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:50:14,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:50:14,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:50:14,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:50:14,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:50:14,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:50:14,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:50:14,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:50:14,483 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:50:14,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:50:14,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:50:14,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:50:14,484 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:50:14,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:50:14,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:50:14,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:50:14,850 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:50:14,850 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:50:14,851 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c [2019-11-24 04:50:14,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bd7893f/37d7a8a2d5374b1ca5b5075a719c03d3/FLAG65c47be1f [2019-11-24 04:50:15,519 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:50:15,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c [2019-11-24 04:50:15,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bd7893f/37d7a8a2d5374b1ca5b5075a719c03d3/FLAG65c47be1f [2019-11-24 04:50:15,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bd7893f/37d7a8a2d5374b1ca5b5075a719c03d3 [2019-11-24 04:50:15,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:50:15,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:50:15,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:50:15,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:50:15,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:50:15,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:50:15" (1/1) ... [2019-11-24 04:50:15,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318fb035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:15, skipping insertion in model container [2019-11-24 04:50:15,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:50:15" (1/1) ... [2019-11-24 04:50:15,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:50:15,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:50:16,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:50:16,621 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:50:16,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:50:16,870 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:50:16,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16 WrapperNode [2019-11-24 04:50:16,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:50:16,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:50:16,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:50:16,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:50:16,881 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:50:16" (1/1) ... [2019-11-24 04:50:16,924 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:50:16" (1/1) ... [2019-11-24 04:50:17,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:50:17,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:50:17,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:50:17,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:50:17,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (1/1) ... [2019-11-24 04:50:17,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:50:17,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:50:17,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:50:17,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:50:17,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (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:50:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:50:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:50:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:50:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:50:17,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:50:39,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:50:39,548 INFO L284 CfgBuilder]: Removed 937 assume(true) statements. [2019-11-24 04:50:39,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:39 BoogieIcfgContainer [2019-11-24 04:50:39,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:50:39,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:50:39,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:50:39,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:50:39,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:50:15" (1/3) ... [2019-11-24 04:50:39,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2082c2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:39, skipping insertion in model container [2019-11-24 04:50:39,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:16" (2/3) ... [2019-11-24 04:50:39,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2082c2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:39, skipping insertion in model container [2019-11-24 04:50:39,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:39" (3/3) ... [2019-11-24 04:50:39,558 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product35.cil.c [2019-11-24 04:50:39,567 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:50:39,574 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 04:50:39,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 04:50:39,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:50:39,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:50:39,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:50:39,605 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:50:39,605 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:50:39,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:50:39,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:50:39,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:50:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-11-24 04:50:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:50:39,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:39,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:39,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1771864942, now seen corresponding path program 1 times [2019-11-24 04:50:39,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:39,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49045761] [2019-11-24 04:50:39,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:40,066 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:50:40,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49045761] [2019-11-24 04:50:40,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:40,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:50:40,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992071558] [2019-11-24 04:50:40,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:50:40,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:40,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:50:40,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:40,091 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-11-24 04:50:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:40,113 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2019-11-24 04:50:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:50:40,114 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:50:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:40,124 INFO L225 Difference]: With dead ends: 104 [2019-11-24 04:50:40,124 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:50:40,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:50:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 04:50:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:50:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 04:50:40,167 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 8 [2019-11-24 04:50:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:40,168 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 04:50:40,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:50:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 04:50:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:50:40,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:40,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:40,170 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1176862005, now seen corresponding path program 1 times [2019-11-24 04:50:40,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:40,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029508428] [2019-11-24 04:50:40,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:40,371 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:50:40,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029508428] [2019-11-24 04:50:40,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:40,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:40,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138033250] [2019-11-24 04:50:40,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:40,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:40,376 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 04:50:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:40,406 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2019-11-24 04:50:40,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:40,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:50:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:40,408 INFO L225 Difference]: With dead ends: 98 [2019-11-24 04:50:40,408 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:50:40,411 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:50:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:50:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-24 04:50:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:50:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2019-11-24 04:50:40,428 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 9 [2019-11-24 04:50:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:40,430 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2019-11-24 04:50:40,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2019-11-24 04:50:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:40,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:40,433 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:40,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash -388539126, now seen corresponding path program 1 times [2019-11-24 04:50:40,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:40,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484049898] [2019-11-24 04:50:40,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:40,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484049898] [2019-11-24 04:50:40,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:40,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:50:40,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39292853] [2019-11-24 04:50:40,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:50:40,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:50:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:40,885 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 6 states. [2019-11-24 04:50:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:41,667 INFO L93 Difference]: Finished difference Result 154 states and 211 transitions. [2019-11-24 04:50:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:50:41,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-24 04:50:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:41,671 INFO L225 Difference]: With dead ends: 154 [2019-11-24 04:50:41,671 INFO L226 Difference]: Without dead ends: 127 [2019-11-24 04:50:41,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:50:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-24 04:50:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2019-11-24 04:50:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-24 04:50:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2019-11-24 04:50:41,688 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 13 [2019-11-24 04:50:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:41,688 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2019-11-24 04:50:41,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:50:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2019-11-24 04:50:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:41,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:41,689 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:41,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash -392672048, now seen corresponding path program 1 times [2019-11-24 04:50:41,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:41,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846076667] [2019-11-24 04:50:41,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:42,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846076667] [2019-11-24 04:50:42,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:42,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:50:42,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159334287] [2019-11-24 04:50:42,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:50:42,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:42,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:50:42,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:50:42,240 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand 8 states. [2019-11-24 04:50:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:44,140 INFO L93 Difference]: Finished difference Result 295 states and 459 transitions. [2019-11-24 04:50:44,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:50:44,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-24 04:50:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:44,145 INFO L225 Difference]: With dead ends: 295 [2019-11-24 04:50:44,145 INFO L226 Difference]: Without dead ends: 293 [2019-11-24 04:50:44,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-24 04:50:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-24 04:50:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 192. [2019-11-24 04:50:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-24 04:50:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 338 transitions. [2019-11-24 04:50:44,177 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 338 transitions. Word has length 13 [2019-11-24 04:50:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:44,177 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 338 transitions. [2019-11-24 04:50:44,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:50:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 338 transitions. [2019-11-24 04:50:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:50:44,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:44,179 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:44,179 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash -599947393, now seen corresponding path program 1 times [2019-11-24 04:50:44,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:44,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188958815] [2019-11-24 04:50:44,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:44,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188958815] [2019-11-24 04:50:44,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:44,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:44,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440911043] [2019-11-24 04:50:44,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:44,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:44,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:44,242 INFO L87 Difference]: Start difference. First operand 192 states and 338 transitions. Second operand 3 states. [2019-11-24 04:50:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:44,279 INFO L93 Difference]: Finished difference Result 562 states and 994 transitions. [2019-11-24 04:50:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:44,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:50:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:44,282 INFO L225 Difference]: With dead ends: 562 [2019-11-24 04:50:44,283 INFO L226 Difference]: Without dead ends: 374 [2019-11-24 04:50:44,284 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:50:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-11-24 04:50:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 330. [2019-11-24 04:50:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-24 04:50:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 602 transitions. [2019-11-24 04:50:44,342 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 602 transitions. Word has length 14 [2019-11-24 04:50:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:44,343 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 602 transitions. [2019-11-24 04:50:44,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 602 transitions. [2019-11-24 04:50:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:50:44,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:44,345 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:44,345 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:44,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash 297988097, now seen corresponding path program 1 times [2019-11-24 04:50:44,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:44,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702642696] [2019-11-24 04:50:44,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702642696] [2019-11-24 04:50:44,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:44,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:44,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386778406] [2019-11-24 04:50:44,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:50:44,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:50:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:50:44,617 INFO L87 Difference]: Start difference. First operand 330 states and 602 transitions. Second operand 4 states. [2019-11-24 04:50:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:45,050 INFO L93 Difference]: Finished difference Result 524 states and 938 transitions. [2019-11-24 04:50:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:50:45,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:50:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:45,055 INFO L225 Difference]: With dead ends: 524 [2019-11-24 04:50:45,055 INFO L226 Difference]: Without dead ends: 471 [2019-11-24 04:50:45,056 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 04:50:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-24 04:50:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 319. [2019-11-24 04:50:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-24 04:50:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 571 transitions. [2019-11-24 04:50:45,090 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 571 transitions. Word has length 15 [2019-11-24 04:50:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:45,090 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 571 transitions. [2019-11-24 04:50:45,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:50:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 571 transitions. [2019-11-24 04:50:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:50:45,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:45,095 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:45,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2103051162, now seen corresponding path program 1 times [2019-11-24 04:50:45,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:45,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798871998] [2019-11-24 04:50:45,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:45,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798871998] [2019-11-24 04:50:45,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:45,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:45,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767579712] [2019-11-24 04:50:45,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:45,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:45,156 INFO L87 Difference]: Start difference. First operand 319 states and 571 transitions. Second operand 3 states. [2019-11-24 04:50:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:45,211 INFO L93 Difference]: Finished difference Result 941 states and 1685 transitions. [2019-11-24 04:50:45,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:45,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:50:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:45,215 INFO L225 Difference]: With dead ends: 941 [2019-11-24 04:50:45,215 INFO L226 Difference]: Without dead ends: 624 [2019-11-24 04:50:45,217 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:50:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-24 04:50:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 585. [2019-11-24 04:50:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-11-24 04:50:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1059 transitions. [2019-11-24 04:50:45,315 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1059 transitions. Word has length 19 [2019-11-24 04:50:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:45,315 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 1059 transitions. [2019-11-24 04:50:45,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1059 transitions. [2019-11-24 04:50:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:50:45,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:45,317 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:45,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1733402313, now seen corresponding path program 1 times [2019-11-24 04:50:45,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:45,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043305952] [2019-11-24 04:50:45,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:45,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043305952] [2019-11-24 04:50:45,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:45,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:45,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518008600] [2019-11-24 04:50:45,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:45,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:45,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:45,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:45,374 INFO L87 Difference]: Start difference. First operand 585 states and 1059 transitions. Second operand 3 states. [2019-11-24 04:50:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:45,445 INFO L93 Difference]: Finished difference Result 1379 states and 2479 transitions. [2019-11-24 04:50:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:45,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:50:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:45,450 INFO L225 Difference]: With dead ends: 1379 [2019-11-24 04:50:45,450 INFO L226 Difference]: Without dead ends: 796 [2019-11-24 04:50:45,451 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:50:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-11-24 04:50:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 761. [2019-11-24 04:50:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-24 04:50:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1359 transitions. [2019-11-24 04:50:45,511 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1359 transitions. Word has length 20 [2019-11-24 04:50:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:45,512 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1359 transitions. [2019-11-24 04:50:45,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1359 transitions. [2019-11-24 04:50:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:50:45,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:45,513 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:45,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 684341353, now seen corresponding path program 1 times [2019-11-24 04:50:45,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:45,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203133306] [2019-11-24 04:50:45,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:45,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203133306] [2019-11-24 04:50:45,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:45,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:45,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671353321] [2019-11-24 04:50:45,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:45,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:45,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:45,569 INFO L87 Difference]: Start difference. First operand 761 states and 1359 transitions. Second operand 3 states. [2019-11-24 04:50:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:45,685 INFO L93 Difference]: Finished difference Result 2247 states and 4009 transitions. [2019-11-24 04:50:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:45,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:50:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:45,694 INFO L225 Difference]: With dead ends: 2247 [2019-11-24 04:50:45,695 INFO L226 Difference]: Without dead ends: 1488 [2019-11-24 04:50:45,697 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:50:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-11-24 04:50:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1449. [2019-11-24 04:50:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-11-24 04:50:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2575 transitions. [2019-11-24 04:50:45,800 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2575 transitions. Word has length 21 [2019-11-24 04:50:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:45,800 INFO L462 AbstractCegarLoop]: Abstraction has 1449 states and 2575 transitions. [2019-11-24 04:50:45,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2575 transitions. [2019-11-24 04:50:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:50:45,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:45,802 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:45,802 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 992502888, now seen corresponding path program 1 times [2019-11-24 04:50:45,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:45,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776176304] [2019-11-24 04:50:45,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:45,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776176304] [2019-11-24 04:50:45,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:45,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:45,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514378866] [2019-11-24 04:50:45,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:45,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:45,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:45,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:45,856 INFO L87 Difference]: Start difference. First operand 1449 states and 2575 transitions. Second operand 3 states. [2019-11-24 04:50:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:46,078 INFO L93 Difference]: Finished difference Result 4279 states and 7593 transitions. [2019-11-24 04:50:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:46,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:50:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:46,097 INFO L225 Difference]: With dead ends: 4279 [2019-11-24 04:50:46,097 INFO L226 Difference]: Without dead ends: 2832 [2019-11-24 04:50:46,100 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:50:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2019-11-24 04:50:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2793. [2019-11-24 04:50:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2793 states. [2019-11-24 04:50:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 4911 transitions. [2019-11-24 04:50:46,333 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 4911 transitions. Word has length 22 [2019-11-24 04:50:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:46,333 INFO L462 AbstractCegarLoop]: Abstraction has 2793 states and 4911 transitions. [2019-11-24 04:50:46,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 4911 transitions. [2019-11-24 04:50:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:50:46,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:46,335 INFO L410 BasicCegarLoop]: trace histogram [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 04:50:46,336 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1126178298, now seen corresponding path program 1 times [2019-11-24 04:50:46,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:46,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040112020] [2019-11-24 04:50:46,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:46,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040112020] [2019-11-24 04:50:46,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:46,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:50:46,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78156831] [2019-11-24 04:50:46,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:50:46,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:50:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:46,495 INFO L87 Difference]: Start difference. First operand 2793 states and 4911 transitions. Second operand 6 states. [2019-11-24 04:50:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:47,627 INFO L93 Difference]: Finished difference Result 5616 states and 9855 transitions. [2019-11-24 04:50:47,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:50:47,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-24 04:50:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:47,661 INFO L225 Difference]: With dead ends: 5616 [2019-11-24 04:50:47,661 INFO L226 Difference]: Without dead ends: 5589 [2019-11-24 04:50:47,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:50:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2019-11-24 04:50:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5550. [2019-11-24 04:50:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5550 states. [2019-11-24 04:50:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5550 states to 5550 states and 9782 transitions. [2019-11-24 04:50:48,162 INFO L78 Accepts]: Start accepts. Automaton has 5550 states and 9782 transitions. Word has length 23 [2019-11-24 04:50:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:48,163 INFO L462 AbstractCegarLoop]: Abstraction has 5550 states and 9782 transitions. [2019-11-24 04:50:48,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:50:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5550 states and 9782 transitions. [2019-11-24 04:50:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:50:48,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:48,164 INFO L410 BasicCegarLoop]: trace histogram [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 04:50:48,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:48,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1122045376, now seen corresponding path program 1 times [2019-11-24 04:50:48,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:48,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594556396] [2019-11-24 04:50:48,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594556396] [2019-11-24 04:50:48,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329334799] [2019-11-24 04:50:48,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:50:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:48,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 04:50:48,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:50:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:48,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:50:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:48,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648293113] [2019-11-24 04:50:48,909 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-24 04:50:48,910 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:50:48,917 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:50:48,924 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:50:48,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs