/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:49:47,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:49:47,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:49:47,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:49:47,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:49:47,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:49:47,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:49:47,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:49:47,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:49:47,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:49:47,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:49:47,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:49:47,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:49:47,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:49:47,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:49:47,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:49:47,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:49:47,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:49:47,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:49:47,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:49:47,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:49:47,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:49:47,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:49:47,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:49:47,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:49:47,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:49:47,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:49:47,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:49:47,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:49:47,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:49:47,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:49:47,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:49:47,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:49:47,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:49:47,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:49:47,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:49:47,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:49:47,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:49:47,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:49:47,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:49:47,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:49:47,724 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:49:47,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:49:47,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:49:47,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:49:47,740 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:49:47,740 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:49:47,741 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:49:47,741 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:49:47,741 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:49:47,741 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:49:47,741 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:49:47,742 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:49:47,742 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:49:47,742 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:49:47,742 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:49:47,742 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:49:47,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:49:47,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:49:47,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:49:47,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:49:47,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:49:47,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:49:47,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:49:47,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:49:47,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:49:47,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:49:47,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:49:47,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:49:47,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:49:47,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:49:47,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:49:47,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:49:47,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:49:47,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:49:47,746 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:49:47,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:49:47,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:49:47,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:49:47,747 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:49:48,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:49:48,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:49:48,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:49:48,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:49:48,082 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:49:48,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-11-24 04:49:48,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdac0be9d/7296a9fc2cb84ffe80645cb91a08073f/FLAGb120a3603 [2019-11-24 04:49:48,826 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:49:48,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-11-24 04:49:48,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdac0be9d/7296a9fc2cb84ffe80645cb91a08073f/FLAGb120a3603 [2019-11-24 04:49:48,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdac0be9d/7296a9fc2cb84ffe80645cb91a08073f [2019-11-24 04:49:48,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:49:49,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:49:49,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:49:49,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:49:49,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:49:49,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:49:48" (1/1) ... [2019-11-24 04:49:49,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa637bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:49, skipping insertion in model container [2019-11-24 04:49:49,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:49:48" (1/1) ... [2019-11-24 04:49:49,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:49:49,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:49:49,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:49:49,939 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:49:50,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:49:50,170 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:49:50,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50 WrapperNode [2019-11-24 04:49:50,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:49:50,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:49:50,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:49:50,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:49:50,181 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:49:50" (1/1) ... [2019-11-24 04:49:50,235 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:49:50" (1/1) ... [2019-11-24 04:49:50,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:49:50,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:49:50,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:49:50,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:49:50,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... [2019-11-24 04:49:50,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:49:50,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:49:50,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:49:50,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:49:50,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:49:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:49:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:49:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:49:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:49:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:50:04,917 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:50:04,917 INFO L284 CfgBuilder]: Removed 725 assume(true) statements. [2019-11-24 04:50:04,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:04 BoogieIcfgContainer [2019-11-24 04:50:04,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:50:04,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:50:04,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:50:04,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:50:04,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:49:48" (1/3) ... [2019-11-24 04:50:04,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d3718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:04, skipping insertion in model container [2019-11-24 04:50:04,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:50" (2/3) ... [2019-11-24 04:50:04,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d3718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:04, skipping insertion in model container [2019-11-24 04:50:04,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:04" (3/3) ... [2019-11-24 04:50:04,929 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product26.cil.c [2019-11-24 04:50:04,937 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:50:04,944 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 04:50:04,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 04:50:04,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:50:04,975 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:50:04,975 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:50:04,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:50:04,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:50:04,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:50:04,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:50:04,976 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:50:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-11-24 04:50:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:50:04,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:04,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:04,999 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash -671213756, now seen corresponding path program 1 times [2019-11-24 04:50:05,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:05,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041167247] [2019-11-24 04:50:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:05,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041167247] [2019-11-24 04:50:05,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:05,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:50:05,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217393697] [2019-11-24 04:50:05,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:50:05,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:05,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:50:05,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:05,414 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-11-24 04:50:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:05,443 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2019-11-24 04:50:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:50:05,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:50:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:05,457 INFO L225 Difference]: With dead ends: 104 [2019-11-24 04:50:05,457 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:50:05,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:50:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 04:50:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:50:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 04:50:05,502 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 8 [2019-11-24 04:50:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:05,503 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 04:50:05,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:50:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 04:50:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:50:05,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:05,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:05,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2068624873, now seen corresponding path program 1 times [2019-11-24 04:50:05,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:05,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267097746] [2019-11-24 04:50:05,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:05,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267097746] [2019-11-24 04:50:05,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:05,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:05,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164400732] [2019-11-24 04:50:05,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:05,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:05,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:05,658 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 04:50:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:05,681 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2019-11-24 04:50:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:05,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:50:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:05,683 INFO L225 Difference]: With dead ends: 98 [2019-11-24 04:50:05,683 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:50:05,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:50:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-24 04:50:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:50:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2019-11-24 04:50:05,698 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 9 [2019-11-24 04:50:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:05,698 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2019-11-24 04:50:05,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2019-11-24 04:50:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:05,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:05,700 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:05,700 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1152444922, now seen corresponding path program 1 times [2019-11-24 04:50:05,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:05,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539954941] [2019-11-24 04:50:05,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:05,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539954941] [2019-11-24 04:50:05,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:05,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:50:05,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767121510] [2019-11-24 04:50:05,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:50:05,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:05,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:50:05,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:50:05,947 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 5 states. [2019-11-24 04:50:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:06,228 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2019-11-24 04:50:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:50:06,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:50:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:06,231 INFO L225 Difference]: With dead ends: 141 [2019-11-24 04:50:06,231 INFO L226 Difference]: Without dead ends: 113 [2019-11-24 04:50:06,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-24 04:50:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2019-11-24 04:50:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-24 04:50:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2019-11-24 04:50:06,246 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 13 [2019-11-24 04:50:06,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:06,247 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2019-11-24 04:50:06,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:50:06,247 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2019-11-24 04:50:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:06,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:06,248 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:06,248 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1143067772, now seen corresponding path program 1 times [2019-11-24 04:50:06,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:06,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757788819] [2019-11-24 04:50:06,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:06,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757788819] [2019-11-24 04:50:06,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:06,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:50:06,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303552809] [2019-11-24 04:50:06,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:50:06,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:50:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:06,515 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand 6 states. [2019-11-24 04:50:07,508 WARN L192 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-24 04:50:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:07,772 INFO L93 Difference]: Finished difference Result 201 states and 303 transitions. [2019-11-24 04:50:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:50:07,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-24 04:50:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:07,776 INFO L225 Difference]: With dead ends: 201 [2019-11-24 04:50:07,776 INFO L226 Difference]: Without dead ends: 180 [2019-11-24 04:50:07,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:50:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-24 04:50:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 142. [2019-11-24 04:50:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-24 04:50:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 239 transitions. [2019-11-24 04:50:07,797 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 239 transitions. Word has length 13 [2019-11-24 04:50:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:07,797 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 239 transitions. [2019-11-24 04:50:07,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:50:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 239 transitions. [2019-11-24 04:50:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:50:07,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:07,799 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:50:07,799 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1286362618, now seen corresponding path program 1 times [2019-11-24 04:50:07,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:07,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901620904] [2019-11-24 04:50:07,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:08,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901620904] [2019-11-24 04:50:08,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:08,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:08,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802839564] [2019-11-24 04:50:08,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:50:08,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:08,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:50:08,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:50:08,102 INFO L87 Difference]: Start difference. First operand 142 states and 239 transitions. Second operand 4 states. [2019-11-24 04:50:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:08,372 INFO L93 Difference]: Finished difference Result 184 states and 287 transitions. [2019-11-24 04:50:08,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:50:08,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:50:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:08,374 INFO L225 Difference]: With dead ends: 184 [2019-11-24 04:50:08,375 INFO L226 Difference]: Without dead ends: 142 [2019-11-24 04:50:08,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:50:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-24 04:50:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2019-11-24 04:50:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-24 04:50:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 225 transitions. [2019-11-24 04:50:08,402 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 225 transitions. Word has length 17 [2019-11-24 04:50:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:08,403 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 225 transitions. [2019-11-24 04:50:08,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:50:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 225 transitions. [2019-11-24 04:50:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:50:08,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:08,404 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:50:08,404 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -168921930, now seen corresponding path program 1 times [2019-11-24 04:50:08,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:08,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377813520] [2019-11-24 04:50:08,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:08,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377813520] [2019-11-24 04:50:08,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:08,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:08,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670709390] [2019-11-24 04:50:08,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:08,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:08,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,471 INFO L87 Difference]: Start difference. First operand 135 states and 225 transitions. Second operand 3 states. [2019-11-24 04:50:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:08,501 INFO L93 Difference]: Finished difference Result 397 states and 663 transitions. [2019-11-24 04:50:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:08,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:50:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:08,503 INFO L225 Difference]: With dead ends: 397 [2019-11-24 04:50:08,503 INFO L226 Difference]: Without dead ends: 264 [2019-11-24 04:50:08,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-24 04:50:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 227. [2019-11-24 04:50:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-24 04:50:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 395 transitions. [2019-11-24 04:50:08,547 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 395 transitions. Word has length 18 [2019-11-24 04:50:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:08,547 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 395 transitions. [2019-11-24 04:50:08,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 395 transitions. [2019-11-24 04:50:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:50:08,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:08,554 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:08,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1208014989, now seen corresponding path program 1 times [2019-11-24 04:50:08,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:08,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971895578] [2019-11-24 04:50:08,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:08,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971895578] [2019-11-24 04:50:08,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:08,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:08,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207139580] [2019-11-24 04:50:08,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:08,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,627 INFO L87 Difference]: Start difference. First operand 227 states and 395 transitions. Second operand 3 states. [2019-11-24 04:50:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:08,658 INFO L93 Difference]: Finished difference Result 669 states and 1165 transitions. [2019-11-24 04:50:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:08,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:50:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:08,661 INFO L225 Difference]: With dead ends: 669 [2019-11-24 04:50:08,661 INFO L226 Difference]: Without dead ends: 444 [2019-11-24 04:50:08,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-24 04:50:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 407. [2019-11-24 04:50:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-24 04:50:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 723 transitions. [2019-11-24 04:50:08,687 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 723 transitions. Word has length 19 [2019-11-24 04:50:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:08,687 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 723 transitions. [2019-11-24 04:50:08,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 723 transitions. [2019-11-24 04:50:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:50:08,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:08,689 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:08,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1508168924, now seen corresponding path program 1 times [2019-11-24 04:50:08,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:08,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820187070] [2019-11-24 04:50:08,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:08,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820187070] [2019-11-24 04:50:08,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:08,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:08,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881631498] [2019-11-24 04:50:08,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:08,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:08,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,746 INFO L87 Difference]: Start difference. First operand 407 states and 723 transitions. Second operand 3 states. [2019-11-24 04:50:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:08,796 INFO L93 Difference]: Finished difference Result 1201 states and 2133 transitions. [2019-11-24 04:50:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:08,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:50:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:08,801 INFO L225 Difference]: With dead ends: 1201 [2019-11-24 04:50:08,801 INFO L226 Difference]: Without dead ends: 796 [2019-11-24 04:50:08,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-11-24 04:50:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 759. [2019-11-24 04:50:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-24 04:50:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1355 transitions. [2019-11-24 04:50:08,848 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1355 transitions. Word has length 20 [2019-11-24 04:50:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:08,848 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1355 transitions. [2019-11-24 04:50:08,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1355 transitions. [2019-11-24 04:50:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:50:08,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:08,849 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:08,850 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1134289214, now seen corresponding path program 1 times [2019-11-24 04:50:08,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:08,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94668122] [2019-11-24 04:50:08,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:08,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94668122] [2019-11-24 04:50:08,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:08,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773003929] [2019-11-24 04:50:08,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:08,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:08,899 INFO L87 Difference]: Start difference. First operand 759 states and 1355 transitions. Second operand 3 states. [2019-11-24 04:50:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:09,009 INFO L93 Difference]: Finished difference Result 2241 states and 3997 transitions. [2019-11-24 04:50:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:09,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:50:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:09,019 INFO L225 Difference]: With dead ends: 2241 [2019-11-24 04:50:09,019 INFO L226 Difference]: Without dead ends: 1484 [2019-11-24 04:50:09,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2019-11-24 04:50:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1447. [2019-11-24 04:50:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-24 04:50:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2571 transitions. [2019-11-24 04:50:09,124 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2571 transitions. Word has length 21 [2019-11-24 04:50:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:09,124 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2571 transitions. [2019-11-24 04:50:09,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2571 transitions. [2019-11-24 04:50:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:50:09,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:09,125 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:09,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash 238599125, now seen corresponding path program 1 times [2019-11-24 04:50:09,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:09,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204295369] [2019-11-24 04:50:09,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:09,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204295369] [2019-11-24 04:50:09,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:09,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:09,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638696986] [2019-11-24 04:50:09,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:09,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:09,182 INFO L87 Difference]: Start difference. First operand 1447 states and 2571 transitions. Second operand 3 states. [2019-11-24 04:50:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:09,377 INFO L93 Difference]: Finished difference Result 4273 states and 7581 transitions. [2019-11-24 04:50:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:09,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:50:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:09,394 INFO L225 Difference]: With dead ends: 4273 [2019-11-24 04:50:09,394 INFO L226 Difference]: Without dead ends: 2828 [2019-11-24 04:50:09,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2019-11-24 04:50:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2791. [2019-11-24 04:50:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-11-24 04:50:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4907 transitions. [2019-11-24 04:50:09,589 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4907 transitions. Word has length 22 [2019-11-24 04:50:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:09,590 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 4907 transitions. [2019-11-24 04:50:09,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4907 transitions. [2019-11-24 04:50:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:50:09,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:09,591 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:09,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash -980932909, now seen corresponding path program 1 times [2019-11-24 04:50:09,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:09,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576518926] [2019-11-24 04:50:09,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:09,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576518926] [2019-11-24 04:50:09,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301035190] [2019-11-24 04:50:09,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:50:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:10,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 04:50:10,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:50:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:10,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:50:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:10,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672819815] [2019-11-24 04:50:10,195 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-24 04:50:10,195 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:50:10,201 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:50:10,207 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:50:10,208 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:51:02,220 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 687 [2019-11-24 04:51:06,440 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 314 DAG size of output: 255 [2019-11-24 04:51:06,921 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 731 [2019-11-24 04:51:09,928 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 1116