/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_spec8_product14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:11:09,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:11:09,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:11:09,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:11:09,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:11:09,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:11:09,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:11:09,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:11:09,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:11:09,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:11:09,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:11:09,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:11:09,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:11:09,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:11:09,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:11:09,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:11:09,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:11:09,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:11:09,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:11:09,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:11:09,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:11:09,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:11:09,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:11:09,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:11:09,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:11:09,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:11:09,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:11:09,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:11:09,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:11:09,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:11:09,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:11:09,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:11:09,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:11:09,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:11:09,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:11:09,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:11:09,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:11:09,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:11:09,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:11:09,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:11:09,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:11:09,586 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 05:11:09,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:11:09,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:11:09,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:11:09,602 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:11:09,603 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:11:09,603 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:11:09,603 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:11:09,603 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:11:09,603 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:11:09,603 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:11:09,604 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:11:09,604 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:11:09,604 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:11:09,604 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:11:09,604 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:11:09,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:11:09,605 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:11:09,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:11:09,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:11:09,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:11:09,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:11:09,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:11:09,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:11:09,607 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:11:09,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:11:09,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:11:09,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:11:09,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:11:09,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:11:09,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:11:09,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:11:09,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:11:09,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:11:09,609 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:11:09,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:11:09,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:11:09,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:11:09,610 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:11:09,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:11:09,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:11:09,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:11:09,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:11:09,936 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:11:09,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c [2019-11-24 05:11:10,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1c55e68/717e164bd49c4c0d98f9b043727cf0a7/FLAG98f76db7f [2019-11-24 05:11:10,623 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:11:10,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c [2019-11-24 05:11:10,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1c55e68/717e164bd49c4c0d98f9b043727cf0a7/FLAG98f76db7f [2019-11-24 05:11:10,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1c55e68/717e164bd49c4c0d98f9b043727cf0a7 [2019-11-24 05:11:10,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:11:10,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:11:10,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:11:10,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:11:10,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:11:10,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:11:10" (1/1) ... [2019-11-24 05:11:10,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5831e857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:10, skipping insertion in model container [2019-11-24 05:11:10,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:11:10" (1/1) ... [2019-11-24 05:11:10,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:11:10,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:11:11,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:11:11,736 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:11:11,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:11:11,975 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:11:11,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11 WrapperNode [2019-11-24 05:11:11,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:11:11,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:11:11,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:11:11,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:11:11,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:11:12,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:11:12,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:11:12,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:11:12,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (1/1) ... [2019-11-24 05:11:12,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:11:12,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:11:12,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:11:12,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:11:12,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (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 05:11:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:11:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:11:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:11:12,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:11:12,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:11:22,956 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:11:22,957 INFO L284 CfgBuilder]: Removed 465 assume(true) statements. [2019-11-24 05:11:22,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:11:22 BoogieIcfgContainer [2019-11-24 05:11:22,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:11:22,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:11:22,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:11:22,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:11:22,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:11:10" (1/3) ... [2019-11-24 05:11:22,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16696e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:11:22, skipping insertion in model container [2019-11-24 05:11:22,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:11" (2/3) ... [2019-11-24 05:11:22,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16696e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:11:22, skipping insertion in model container [2019-11-24 05:11:22,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:11:22" (3/3) ... [2019-11-24 05:11:22,968 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product14.cil.c [2019-11-24 05:11:22,977 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:11:22,984 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:11:22,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:11:23,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:11:23,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:11:23,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:11:23,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:11:23,021 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:11:23,021 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:11:23,021 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:11:23,021 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:11:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:11:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:11:23,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:23,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:23,047 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 05:11:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1196235340, now seen corresponding path program 1 times [2019-11-24 05:11:23,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:23,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607001902] [2019-11-24 05:11:23,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:23,423 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 05:11:23,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607001902] [2019-11-24 05:11:23,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:23,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:11:23,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378740236] [2019-11-24 05:11:23,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:11:23,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:23,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:11:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:11:23,450 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:11:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:23,480 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:11:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:11:23,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:11:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:23,495 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:11:23,495 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:11:23,499 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 05:11:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:11:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:11:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:11:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:11:23,559 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:11:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:23,559 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:11:23,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:11:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:11:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:11:23,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:23,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:23,563 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 05:11:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash -297837526, now seen corresponding path program 1 times [2019-11-24 05:11:23,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:23,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837534310] [2019-11-24 05:11:23,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:23,708 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 05:11:23,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837534310] [2019-11-24 05:11:23,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:23,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196093704] [2019-11-24 05:11:23,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:23,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:23,713 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:11:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:23,738 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:11:23,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:23,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:11:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:23,742 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:11:23,742 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:11:23,744 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 05:11:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:11:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:11:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:11:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:11:23,765 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:11:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:23,766 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:11:23,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:11:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:11:23,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:23,769 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:23,769 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 05:11:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:23,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2121482724, now seen corresponding path program 1 times [2019-11-24 05:11:23,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:23,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617713352] [2019-11-24 05:11:23,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:23,990 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 05:11:23,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617713352] [2019-11-24 05:11:23,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:23,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:11:23,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290533522] [2019-11-24 05:11:23,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:23,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:23,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:23,994 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:11:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:24,081 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:11:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:24,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:11:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:24,084 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:11:24,084 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:11:24,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:11:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:11:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:11:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:11:24,096 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:11:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:24,096 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:11:24,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:11:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:11:24,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:24,099 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:24,099 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 05:11:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash 861743075, now seen corresponding path program 1 times [2019-11-24 05:11:24,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:24,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649258132] [2019-11-24 05:11:24,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:24,305 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 05:11:24,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649258132] [2019-11-24 05:11:24,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:24,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:11:24,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499857559] [2019-11-24 05:11:24,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:11:24,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:11:24,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:11:24,310 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 5 states. [2019-11-24 05:11:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:24,540 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2019-11-24 05:11:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 05:11:24,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 05:11:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:24,542 INFO L225 Difference]: With dead ends: 124 [2019-11-24 05:11:24,542 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 05:11:24,543 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 05:11:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 05:11:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-11-24 05:11:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 05:11:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2019-11-24 05:11:24,554 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 15 [2019-11-24 05:11:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:24,554 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2019-11-24 05:11:24,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:11:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2019-11-24 05:11:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:11:24,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:24,556 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:24,556 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 05:11:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1828611507, now seen corresponding path program 1 times [2019-11-24 05:11:24,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:24,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787847717] [2019-11-24 05:11:24,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:24,659 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 05:11:24,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787847717] [2019-11-24 05:11:24,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:24,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:24,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377430768] [2019-11-24 05:11:24,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:11:24,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:24,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:11:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:11:24,662 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand 4 states. [2019-11-24 05:11:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:24,681 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2019-11-24 05:11:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:11:24,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:11:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:24,683 INFO L225 Difference]: With dead ends: 81 [2019-11-24 05:11:24,683 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 05:11:24,684 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 05:11:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 05:11:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-24 05:11:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-24 05:11:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2019-11-24 05:11:24,692 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 18 [2019-11-24 05:11:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:24,692 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2019-11-24 05:11:24,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:11:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2019-11-24 05:11:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:11:24,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:24,694 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 05:11:24,694 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 05:11:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash -15166477, now seen corresponding path program 1 times [2019-11-24 05:11:24,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:24,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425479372] [2019-11-24 05:11:24,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:24,751 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 05:11:24,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425479372] [2019-11-24 05:11:24,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:24,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:24,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785400814] [2019-11-24 05:11:24,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:24,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:24,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:24,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:24,753 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 3 states. [2019-11-24 05:11:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:24,774 INFO L93 Difference]: Finished difference Result 168 states and 292 transitions. [2019-11-24 05:11:24,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:24,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 05:11:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:24,776 INFO L225 Difference]: With dead ends: 168 [2019-11-24 05:11:24,776 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 05:11:24,776 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 05:11:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 05:11:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2019-11-24 05:11:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-24 05:11:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 185 transitions. [2019-11-24 05:11:24,790 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 185 transitions. Word has length 22 [2019-11-24 05:11:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:24,790 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 185 transitions. [2019-11-24 05:11:24,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 185 transitions. [2019-11-24 05:11:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 05:11:24,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:24,792 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 05:11:24,792 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 05:11:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash 144307894, now seen corresponding path program 1 times [2019-11-24 05:11:24,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:24,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232429773] [2019-11-24 05:11:24,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:24,876 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 05:11:24,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232429773] [2019-11-24 05:11:24,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:24,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:24,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106503779] [2019-11-24 05:11:24,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:24,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:24,879 INFO L87 Difference]: Start difference. First operand 104 states and 185 transitions. Second operand 3 states. [2019-11-24 05:11:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:24,898 INFO L93 Difference]: Finished difference Result 304 states and 543 transitions. [2019-11-24 05:11:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:24,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 05:11:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:24,900 INFO L225 Difference]: With dead ends: 304 [2019-11-24 05:11:24,900 INFO L226 Difference]: Without dead ends: 202 [2019-11-24 05:11:24,904 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 05:11:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-24 05:11:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-11-24 05:11:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 05:11:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 349 transitions. [2019-11-24 05:11:24,946 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 349 transitions. Word has length 23 [2019-11-24 05:11:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:24,947 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 349 transitions. [2019-11-24 05:11:24,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 349 transitions. [2019-11-24 05:11:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:11:24,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:24,953 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, 1] [2019-11-24 05:11:24,953 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 05:11:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash -632081375, now seen corresponding path program 1 times [2019-11-24 05:11:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:24,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383232649] [2019-11-24 05:11:24,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:25,031 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 05:11:25,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383232649] [2019-11-24 05:11:25,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:25,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:25,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343523875] [2019-11-24 05:11:25,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:25,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:25,034 INFO L87 Difference]: Start difference. First operand 194 states and 349 transitions. Second operand 3 states. [2019-11-24 05:11:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:25,067 INFO L93 Difference]: Finished difference Result 570 states and 1027 transitions. [2019-11-24 05:11:25,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:25,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:11:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:25,070 INFO L225 Difference]: With dead ends: 570 [2019-11-24 05:11:25,070 INFO L226 Difference]: Without dead ends: 378 [2019-11-24 05:11:25,072 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 05:11:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-24 05:11:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-24 05:11:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-24 05:11:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 665 transitions. [2019-11-24 05:11:25,099 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 665 transitions. Word has length 24 [2019-11-24 05:11:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:25,099 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 665 transitions. [2019-11-24 05:11:25,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 665 transitions. [2019-11-24 05:11:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 05:11:25,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:25,101 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, 1, 1] [2019-11-24 05:11:25,102 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 05:11:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash -197120648, now seen corresponding path program 1 times [2019-11-24 05:11:25,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:25,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160898240] [2019-11-24 05:11:25,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:25,251 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 05:11:25,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160898240] [2019-11-24 05:11:25,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:25,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:25,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842935340] [2019-11-24 05:11:25,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:25,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:25,257 INFO L87 Difference]: Start difference. First operand 370 states and 665 transitions. Second operand 3 states. [2019-11-24 05:11:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:25,321 INFO L93 Difference]: Finished difference Result 1090 states and 1959 transitions. [2019-11-24 05:11:25,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:25,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 05:11:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:25,330 INFO L225 Difference]: With dead ends: 1090 [2019-11-24 05:11:25,330 INFO L226 Difference]: Without dead ends: 722 [2019-11-24 05:11:25,331 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 05:11:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-24 05:11:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 714. [2019-11-24 05:11:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-24 05:11:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1273 transitions. [2019-11-24 05:11:25,381 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1273 transitions. Word has length 25 [2019-11-24 05:11:25,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:25,382 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1273 transitions. [2019-11-24 05:11:25,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1273 transitions. [2019-11-24 05:11:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:11:25,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:25,384 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, 1, 1, 1] [2019-11-24 05:11:25,384 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 05:11:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:25,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1220043918, now seen corresponding path program 1 times [2019-11-24 05:11:25,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:25,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530357108] [2019-11-24 05:11:25,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:25,465 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 05:11:25,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530357108] [2019-11-24 05:11:25,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:25,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:25,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151400674] [2019-11-24 05:11:25,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:25,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:25,467 INFO L87 Difference]: Start difference. First operand 714 states and 1273 transitions. Second operand 3 states. [2019-11-24 05:11:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:25,578 INFO L93 Difference]: Finished difference Result 2106 states and 3751 transitions. [2019-11-24 05:11:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:25,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:11:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:25,591 INFO L225 Difference]: With dead ends: 2106 [2019-11-24 05:11:25,592 INFO L226 Difference]: Without dead ends: 1394 [2019-11-24 05:11:25,594 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 05:11:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-11-24 05:11:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1386. [2019-11-24 05:11:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-11-24 05:11:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2441 transitions. [2019-11-24 05:11:25,691 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2441 transitions. Word has length 26 [2019-11-24 05:11:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:25,692 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 2441 transitions. [2019-11-24 05:11:25,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2441 transitions. [2019-11-24 05:11:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:11:25,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:25,694 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, 1, 1, 1, 1] [2019-11-24 05:11:25,694 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 05:11:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -188608023, now seen corresponding path program 1 times [2019-11-24 05:11:25,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:25,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082190360] [2019-11-24 05:11:25,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:25,767 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 05:11:25,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082190360] [2019-11-24 05:11:25,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:25,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:25,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332484103] [2019-11-24 05:11:25,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:25,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:25,769 INFO L87 Difference]: Start difference. First operand 1386 states and 2441 transitions. Second operand 3 states. [2019-11-24 05:11:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:25,939 INFO L93 Difference]: Finished difference Result 4090 states and 7191 transitions. [2019-11-24 05:11:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:25,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:11:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:25,954 INFO L225 Difference]: With dead ends: 4090 [2019-11-24 05:11:25,955 INFO L226 Difference]: Without dead ends: 2706 [2019-11-24 05:11:25,959 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 05:11:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-11-24 05:11:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2698. [2019-11-24 05:11:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-24 05:11:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4681 transitions. [2019-11-24 05:11:26,147 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4681 transitions. Word has length 27 [2019-11-24 05:11:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:26,147 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 4681 transitions. [2019-11-24 05:11:26,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4681 transitions. [2019-11-24 05:11:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:11:26,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:26,149 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, 1, 1, 1, 1, 1] [2019-11-24 05:11:26,149 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 05:11:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2084592385, now seen corresponding path program 1 times [2019-11-24 05:11:26,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:26,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959482748] [2019-11-24 05:11:26,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:26,306 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 05:11:26,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959482748] [2019-11-24 05:11:26,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:26,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:26,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978713424] [2019-11-24 05:11:26,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:26,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:26,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:26,309 INFO L87 Difference]: Start difference. First operand 2698 states and 4681 transitions. Second operand 3 states. [2019-11-24 05:11:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:26,585 INFO L93 Difference]: Finished difference Result 7962 states and 13783 transitions. [2019-11-24 05:11:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:26,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:11:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:26,613 INFO L225 Difference]: With dead ends: 7962 [2019-11-24 05:11:26,613 INFO L226 Difference]: Without dead ends: 5266 [2019-11-24 05:11:26,619 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 05:11:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2019-11-24 05:11:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5258. [2019-11-24 05:11:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-11-24 05:11:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 8969 transitions. [2019-11-24 05:11:26,963 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 8969 transitions. Word has length 28 [2019-11-24 05:11:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:26,963 INFO L462 AbstractCegarLoop]: Abstraction has 5258 states and 8969 transitions. [2019-11-24 05:11:26,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8969 transitions. [2019-11-24 05:11:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:11:26,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:26,965 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, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:26,965 INFO L410 AbstractCegarLoop]: === Iteration 13 === [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 05:11:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1643757387, now seen corresponding path program 1 times [2019-11-24 05:11:26,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:26,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717068082] [2019-11-24 05:11:26,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:27,171 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 05:11:27,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717068082] [2019-11-24 05:11:27,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:27,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:11:27,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525525157] [2019-11-24 05:11:27,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:11:27,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:11:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:11:27,175 INFO L87 Difference]: Start difference. First operand 5258 states and 8969 transitions. Second operand 7 states. [2019-11-24 05:11:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:28,075 INFO L93 Difference]: Finished difference Result 5970 states and 10144 transitions. [2019-11-24 05:11:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:11:28,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-24 05:11:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:28,110 INFO L225 Difference]: With dead ends: 5970 [2019-11-24 05:11:28,110 INFO L226 Difference]: Without dead ends: 5962 [2019-11-24 05:11:28,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:11:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2019-11-24 05:11:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5930. [2019-11-24 05:11:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-11-24 05:11:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 10057 transitions. [2019-11-24 05:11:28,476 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 10057 transitions. Word has length 29 [2019-11-24 05:11:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:28,476 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 10057 transitions. [2019-11-24 05:11:28,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:11:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 10057 transitions. [2019-11-24 05:11:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 05:11:28,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:28,479 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:28,480 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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 05:11:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 74479310, now seen corresponding path program 1 times [2019-11-24 05:11:28,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:28,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009928173] [2019-11-24 05:11:28,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:28,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009928173] [2019-11-24 05:11:28,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582836299] [2019-11-24 05:11:28,981 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 05:11:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:29,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 05:11:29,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:11:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:29,415 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:11:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:29,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933515202] [2019-11-24 05:11:29,521 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-11-24 05:11:29,521 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:11:29,529 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:11:29,536 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:11:29,537 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:12:26,121 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 705 [2019-11-24 05:12:30,188 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 306 DAG size of output: 249 [2019-11-24 05:12:30,675 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 744 [2019-11-24 05:12:30,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8