/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_spec1_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:55:06,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:55:06,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:55:06,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:55:06,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:55:06,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:55:06,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:55:06,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:55:06,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:55:06,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:55:06,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:55:06,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:55:06,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:55:06,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:55:06,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:55:06,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:55:06,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:55:06,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:55:06,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:55:06,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:55:06,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:55:06,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:55:06,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:55:06,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:55:06,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:55:06,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:55:06,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:55:06,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:55:06,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:55:06,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:55:06,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:55:06,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:55:06,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:55:06,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:55:06,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:55:06,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:55:06,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:55:06,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:55:06,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:55:06,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:55:06,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:55:06,818 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:55:06,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:55:06,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:55:06,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:55:06,856 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:55:06,856 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:55:06,856 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:55:06,856 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:55:06,856 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:55:06,857 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:55:06,857 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:55:06,857 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:55:06,857 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:55:06,857 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:55:06,857 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:55:06,859 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:55:06,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:55:06,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:55:06,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:55:06,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:55:06,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:55:06,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:55:06,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:55:06,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:55:06,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:55:06,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:55:06,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:55:06,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:55:06,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:55:06,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:55:06,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:55:06,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:55:06,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:55:06,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:55:06,863 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:55:06,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:55:06,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:55:06,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:55:06,865 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:55:07,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:55:07,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:55:07,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:55:07,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:55:07,150 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:55:07,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product34.cil.c [2019-11-24 04:55:07,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dff3708/7375c12d13bf4907bdbc30f5cabc9b20/FLAG3ce8bc5a0 [2019-11-24 04:55:07,815 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:55:07,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product34.cil.c [2019-11-24 04:55:07,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dff3708/7375c12d13bf4907bdbc30f5cabc9b20/FLAG3ce8bc5a0 [2019-11-24 04:55:07,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dff3708/7375c12d13bf4907bdbc30f5cabc9b20 [2019-11-24 04:55:07,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:55:08,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:55:08,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:55:08,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:55:08,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:55:08,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:55:07" (1/1) ... [2019-11-24 04:55:08,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62807e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:08, skipping insertion in model container [2019-11-24 04:55:08,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:55:07" (1/1) ... [2019-11-24 04:55:08,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:55:08,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:55:08,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:55:08,917 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:55:09,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:55:09,155 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:55:09,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09 WrapperNode [2019-11-24 04:55:09,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:55:09,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:55:09,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:55:09,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:55:09,167 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:55:09" (1/1) ... [2019-11-24 04:55:09,208 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:55:09" (1/1) ... [2019-11-24 04:55:09,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:55:09,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:55:09,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:55:09,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:55:09,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (1/1) ... [2019-11-24 04:55:09,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:55:09,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:55:09,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:55:09,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:55:09,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (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:55:09,714 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:55:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:55:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:55:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:55:09,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:55:32,506 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:55:32,506 INFO L284 CfgBuilder]: Removed 849 assume(true) statements. [2019-11-24 04:55:32,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:55:32 BoogieIcfgContainer [2019-11-24 04:55:32,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:55:32,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:55:32,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:55:32,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:55:32,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:55:07" (1/3) ... [2019-11-24 04:55:32,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d8f4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:55:32, skipping insertion in model container [2019-11-24 04:55:32,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:55:09" (2/3) ... [2019-11-24 04:55:32,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d8f4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:55:32, skipping insertion in model container [2019-11-24 04:55:32,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:55:32" (3/3) ... [2019-11-24 04:55:32,517 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product34.cil.c [2019-11-24 04:55:32,532 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:55:32,543 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 04:55:32,561 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 04:55:32,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:55:32,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:55:32,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:55:32,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:55:32,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:55:32,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:55:32,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:55:32,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:55:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 04:55:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:55:32,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:32,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:55:32,636 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:55:32,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1570979909, now seen corresponding path program 1 times [2019-11-24 04:55:32,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:32,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673200939] [2019-11-24 04:55:32,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:33,085 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:55:33,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673200939] [2019-11-24 04:55:33,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:33,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:55:33,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362997348] [2019-11-24 04:55:33,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:55:33,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:55:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:55:33,123 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 04:55:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:33,160 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 04:55:33,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:55:33,162 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:55:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:33,179 INFO L225 Difference]: With dead ends: 100 [2019-11-24 04:55:33,179 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 04:55:33,184 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:55:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 04:55:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 04:55:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 04:55:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 04:55:33,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 04:55:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:33,258 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 04:55:33,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:55:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 04:55:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:55:33,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:33,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:55:33,261 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:55:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1215162740, now seen corresponding path program 1 times [2019-11-24 04:55:33,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:33,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043480178] [2019-11-24 04:55:33,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:33,455 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:55:33,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043480178] [2019-11-24 04:55:33,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:33,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:55:33,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523910419] [2019-11-24 04:55:33,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:55:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:55:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:55:33,459 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 04:55:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:33,478 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 04:55:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:55:33,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:55:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:33,480 INFO L225 Difference]: With dead ends: 94 [2019-11-24 04:55:33,480 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:55:33,482 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:55:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:55:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 04:55:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:55:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 04:55:33,491 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 04:55:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:33,491 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 04:55:33,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:55:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 04:55:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:55:33,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:33,492 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:55:33,493 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:55:33,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1449066452, now seen corresponding path program 1 times [2019-11-24 04:55:33,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:33,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739346638] [2019-11-24 04:55:33,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:33,640 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:55:33,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739346638] [2019-11-24 04:55:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:55:33,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535300778] [2019-11-24 04:55:33,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:55:33,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:33,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:55:33,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:55:33,645 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 04:55:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:33,697 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2019-11-24 04:55:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:55:33,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:55:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:33,699 INFO L225 Difference]: With dead ends: 84 [2019-11-24 04:55:33,699 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 04:55:33,700 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 04:55:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 04:55:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-24 04:55:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 04:55:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 04:55:33,708 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 04:55:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:33,708 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 04:55:33,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:55:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 04:55:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:55:33,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:33,710 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:55:33,710 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:55:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1100166220, now seen corresponding path program 1 times [2019-11-24 04:55:33,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:33,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002885583] [2019-11-24 04:55:33,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:34,554 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:55:34,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002885583] [2019-11-24 04:55:34,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:34,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:55:34,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040103808] [2019-11-24 04:55:34,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 04:55:34,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 04:55:34,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:55:34,557 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 10 states. [2019-11-24 04:55:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:36,851 INFO L93 Difference]: Finished difference Result 139 states and 215 transitions. [2019-11-24 04:55:36,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:55:36,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-24 04:55:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:36,854 INFO L225 Difference]: With dead ends: 139 [2019-11-24 04:55:36,854 INFO L226 Difference]: Without dead ends: 120 [2019-11-24 04:55:36,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:55:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-24 04:55:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2019-11-24 04:55:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-24 04:55:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 181 transitions. [2019-11-24 04:55:36,889 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 181 transitions. Word has length 15 [2019-11-24 04:55:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:36,889 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 181 transitions. [2019-11-24 04:55:36,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 04:55:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 181 transitions. [2019-11-24 04:55:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:55:36,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:36,892 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:55:36,893 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:55:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1584537341, now seen corresponding path program 1 times [2019-11-24 04:55:36,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:36,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965428110] [2019-11-24 04:55:36,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:36,963 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:55:36,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965428110] [2019-11-24 04:55:36,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:36,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:55:36,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374416705] [2019-11-24 04:55:36,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:55:36,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:36,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:55:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:55:36,965 INFO L87 Difference]: Start difference. First operand 109 states and 181 transitions. Second operand 3 states. [2019-11-24 04:55:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:36,991 INFO L93 Difference]: Finished difference Result 316 states and 529 transitions. [2019-11-24 04:55:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:55:36,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:55:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:36,994 INFO L225 Difference]: With dead ends: 316 [2019-11-24 04:55:36,994 INFO L226 Difference]: Without dead ends: 211 [2019-11-24 04:55:36,995 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:55:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-24 04:55:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 178. [2019-11-24 04:55:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-24 04:55:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 313 transitions. [2019-11-24 04:55:37,021 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 313 transitions. Word has length 16 [2019-11-24 04:55:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:37,022 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 313 transitions. [2019-11-24 04:55:37,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:55:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 313 transitions. [2019-11-24 04:55:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:55:37,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:37,024 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:55:37,024 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:55:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1945945464, now seen corresponding path program 1 times [2019-11-24 04:55:37,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:37,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093753159] [2019-11-24 04:55:37,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:37,495 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:55:37,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093753159] [2019-11-24 04:55:37,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:37,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:55:37,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478972352] [2019-11-24 04:55:37,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:55:37,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:55:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:55:37,498 INFO L87 Difference]: Start difference. First operand 178 states and 313 transitions. Second operand 9 states. [2019-11-24 04:55:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:39,191 INFO L93 Difference]: Finished difference Result 241 states and 403 transitions. [2019-11-24 04:55:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 04:55:39,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-24 04:55:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:39,202 INFO L225 Difference]: With dead ends: 241 [2019-11-24 04:55:39,203 INFO L226 Difference]: Without dead ends: 222 [2019-11-24 04:55:39,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:55:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-24 04:55:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 200. [2019-11-24 04:55:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-24 04:55:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 355 transitions. [2019-11-24 04:55:39,240 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 355 transitions. Word has length 17 [2019-11-24 04:55:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:39,240 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 355 transitions. [2019-11-24 04:55:39,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:55:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 355 transitions. [2019-11-24 04:55:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:55:39,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:39,244 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 04:55:39,244 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:55:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 542525563, now seen corresponding path program 1 times [2019-11-24 04:55:39,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:39,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522946656] [2019-11-24 04:55:39,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:39,644 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:55:39,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522946656] [2019-11-24 04:55:39,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:39,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:55:39,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064839169] [2019-11-24 04:55:39,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:55:39,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:39,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:55:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:55:39,649 INFO L87 Difference]: Start difference. First operand 200 states and 355 transitions. Second operand 8 states. [2019-11-24 04:55:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:40,229 INFO L93 Difference]: Finished difference Result 389 states and 698 transitions. [2019-11-24 04:55:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:55:40,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-24 04:55:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:40,237 INFO L225 Difference]: With dead ends: 389 [2019-11-24 04:55:40,237 INFO L226 Difference]: Without dead ends: 371 [2019-11-24 04:55:40,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:55:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-24 04:55:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-11-24 04:55:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-24 04:55:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 674 transitions. [2019-11-24 04:55:40,285 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 674 transitions. Word has length 18 [2019-11-24 04:55:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:40,285 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 674 transitions. [2019-11-24 04:55:40,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:55:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 674 transitions. [2019-11-24 04:55:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:55:40,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:40,287 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:55:40,287 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:55:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1780246396, now seen corresponding path program 1 times [2019-11-24 04:55:40,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:40,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190145225] [2019-11-24 04:55:40,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:40,356 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:55:40,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190145225] [2019-11-24 04:55:40,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:40,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:55:40,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063079497] [2019-11-24 04:55:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:55:40,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:55:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:55:40,358 INFO L87 Difference]: Start difference. First operand 367 states and 674 transitions. Second operand 3 states. [2019-11-24 04:55:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:40,414 INFO L93 Difference]: Finished difference Result 1079 states and 1986 transitions. [2019-11-24 04:55:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:55:40,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:55:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:40,419 INFO L225 Difference]: With dead ends: 1079 [2019-11-24 04:55:40,419 INFO L226 Difference]: Without dead ends: 716 [2019-11-24 04:55:40,420 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:55:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-24 04:55:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 679. [2019-11-24 04:55:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-24 04:55:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1262 transitions. [2019-11-24 04:55:40,476 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1262 transitions. Word has length 19 [2019-11-24 04:55:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:40,476 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 1262 transitions. [2019-11-24 04:55:40,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:55:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1262 transitions. [2019-11-24 04:55:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:55:40,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:40,477 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:55:40,478 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:55:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash -706905353, now seen corresponding path program 1 times [2019-11-24 04:55:40,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:40,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030089306] [2019-11-24 04:55:40,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:40,538 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:55:40,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030089306] [2019-11-24 04:55:40,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:40,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:55:40,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736659905] [2019-11-24 04:55:40,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:55:40,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:55:40,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:55:40,541 INFO L87 Difference]: Start difference. First operand 679 states and 1262 transitions. Second operand 3 states. [2019-11-24 04:55:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:40,643 INFO L93 Difference]: Finished difference Result 2001 states and 3722 transitions. [2019-11-24 04:55:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:55:40,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:55:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:40,651 INFO L225 Difference]: With dead ends: 2001 [2019-11-24 04:55:40,652 INFO L226 Difference]: Without dead ends: 1326 [2019-11-24 04:55:40,654 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:55:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-11-24 04:55:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1289. [2019-11-24 04:55:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2019-11-24 04:55:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2396 transitions. [2019-11-24 04:55:40,752 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2396 transitions. Word has length 20 [2019-11-24 04:55:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:40,752 INFO L462 AbstractCegarLoop]: Abstraction has 1289 states and 2396 transitions. [2019-11-24 04:55:40,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:55:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2396 transitions. [2019-11-24 04:55:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:55:40,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:40,754 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:55:40,754 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:55:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1057887387, now seen corresponding path program 1 times [2019-11-24 04:55:40,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:40,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082131831] [2019-11-24 04:55:40,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:41,131 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:55:41,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082131831] [2019-11-24 04:55:41,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:55:41,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:55:41,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902796727] [2019-11-24 04:55:41,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:55:41,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:55:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:55:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:55:41,133 INFO L87 Difference]: Start difference. First operand 1289 states and 2396 transitions. Second operand 9 states. [2019-11-24 04:55:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:55:42,172 INFO L93 Difference]: Finished difference Result 1318 states and 2427 transitions. [2019-11-24 04:55:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:55:42,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-24 04:55:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:55:42,183 INFO L225 Difference]: With dead ends: 1318 [2019-11-24 04:55:42,183 INFO L226 Difference]: Without dead ends: 1295 [2019-11-24 04:55:42,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:55:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-11-24 04:55:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1289. [2019-11-24 04:55:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2019-11-24 04:55:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2368 transitions. [2019-11-24 04:55:42,280 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2368 transitions. Word has length 21 [2019-11-24 04:55:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:55:42,282 INFO L462 AbstractCegarLoop]: Abstraction has 1289 states and 2368 transitions. [2019-11-24 04:55:42,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:55:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2368 transitions. [2019-11-24 04:55:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:55:42,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:55:42,283 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:55:42,284 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:55:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:55:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 311324998, now seen corresponding path program 1 times [2019-11-24 04:55:42,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:55:42,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259149605] [2019-11-24 04:55:42,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:55:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:42,640 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:55:42,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259149605] [2019-11-24 04:55:42,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678192206] [2019-11-24 04:55:42,641 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:55:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:55:43,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 04:55:43,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:55:43,208 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:55:43,208 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:55:43,249 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:55:43,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [499294362] [2019-11-24 04:55:43,282 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-11-24 04:55:43,282 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:55:43,289 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:55:43,295 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:55:43,296 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs