/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_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:49:03,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:49:03,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:49:03,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:49:03,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:49:03,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:49:03,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:49:03,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:49:03,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:49:03,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:49:03,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:49:03,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:49:03,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:49:03,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:49:03,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:49:03,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:49:03,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:49:03,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:49:03,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:49:03,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:49:03,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:49:03,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:49:03,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:49:03,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:49:03,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:49:03,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:49:03,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:49:03,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:49:03,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:49:03,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:49:03,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:49:03,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:49:03,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:49:03,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:49:03,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:49:03,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:49:03,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:49:03,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:49:03,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:49:03,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:49:03,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:49:03,872 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:03,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:49:03,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:49:03,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:49:03,888 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:49:03,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:49:03,888 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:49:03,889 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:49:03,889 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:49:03,889 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:49:03,889 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:49:03,889 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:49:03,889 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:49:03,890 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:49:03,890 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:49:03,890 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:49:03,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:49:03,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:49:03,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:49:03,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:49:03,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:49:03,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:49:03,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:49:03,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:49:03,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:49:03,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:49:03,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:49:03,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:49:03,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:49:03,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:49:03,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:49:03,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:49:03,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:49:03,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:49:03,894 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:49:03,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:49:03,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:49:03,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:49:03,895 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:49:04,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:49:04,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:49:04,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:49:04,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:49:04,208 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:49:04,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-11-24 04:49:04,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ddc347f4/214cdda435b24ab1b632866e8210ca63/FLAG555e3a363 [2019-11-24 04:49:04,904 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:49:04,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-11-24 04:49:04,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ddc347f4/214cdda435b24ab1b632866e8210ca63/FLAG555e3a363 [2019-11-24 04:49:05,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ddc347f4/214cdda435b24ab1b632866e8210ca63 [2019-11-24 04:49:05,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:49:05,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:49:05,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:49:05,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:49:05,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:49:05,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:49:05" (1/1) ... [2019-11-24 04:49:05,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfe3d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:05, skipping insertion in model container [2019-11-24 04:49:05,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:49:05" (1/1) ... [2019-11-24 04:49:05,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:49:05,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:49:06,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:49:06,116 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:49:06,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:49:06,406 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:49:06,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:06 WrapperNode [2019-11-24 04:49:06,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:49:06,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:49:06,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:49:06,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:49:06,418 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:06" (1/1) ... [2019-11-24 04:49:06,484 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:06" (1/1) ... [2019-11-24 04:49:06,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:49:06,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:49:06,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:49:06,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:49:06,690 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:06" (1/1) ... [2019-11-24 04:49:06,690 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:06" (1/1) ... [2019-11-24 04:49:06,724 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:06" (1/1) ... [2019-11-24 04:49:06,724 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:06" (1/1) ... [2019-11-24 04:49:06,799 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:06" (1/1) ... [2019-11-24 04:49:06,839 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:06" (1/1) ... [2019-11-24 04:49:06,852 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:06" (1/1) ... [2019-11-24 04:49:06,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:49:06,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:49:06,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:49:06,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:49:06,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:06" (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:06,948 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:49:06,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:49:06,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:49:06,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:49:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:49:20,825 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:49:20,826 INFO L284 CfgBuilder]: Removed 649 assume(true) statements. [2019-11-24 04:49:20,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:49:20 BoogieIcfgContainer [2019-11-24 04:49:20,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:49:20,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:49:20,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:49:20,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:49:20,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:49:05" (1/3) ... [2019-11-24 04:49:20,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e84146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:49:20, skipping insertion in model container [2019-11-24 04:49:20,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:49:06" (2/3) ... [2019-11-24 04:49:20,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e84146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:49:20, skipping insertion in model container [2019-11-24 04:49:20,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:49:20" (3/3) ... [2019-11-24 04:49:20,845 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product21.cil.c [2019-11-24 04:49:20,854 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:49:20,861 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 04:49:20,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 04:49:20,894 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:49:20,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:49:20,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:49:20,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:49:20,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:49:20,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:49:20,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:49:20,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:49:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-11-24 04:49:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:49:20,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:20,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:49:20,922 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:49:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1887445206, now seen corresponding path program 1 times [2019-11-24 04:49:20,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:20,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343678455] [2019-11-24 04:49:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:21,325 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:49:21,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343678455] [2019-11-24 04:49:21,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:21,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:49:21,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967579673] [2019-11-24 04:49:21,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:49:21,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:21,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:49:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:49:21,349 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-11-24 04:49:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:21,376 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2019-11-24 04:49:21,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:49:21,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:49:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:21,390 INFO L225 Difference]: With dead ends: 104 [2019-11-24 04:49:21,391 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:49:21,394 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:49:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:49:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 04:49:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:49:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 04:49:21,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 8 [2019-11-24 04:49:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:21,440 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 04:49:21,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:49:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 04:49:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:49:21,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:21,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:49:21,442 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:49:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:21,443 INFO L82 PathProgramCache]: Analyzing trace with hash 103837932, now seen corresponding path program 1 times [2019-11-24 04:49:21,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:21,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724487495] [2019-11-24 04:49:21,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:21,611 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:49:21,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724487495] [2019-11-24 04:49:21,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:21,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:21,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757466491] [2019-11-24 04:49:21,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:49:21,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:49:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:49:21,616 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 04:49:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:21,646 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2019-11-24 04:49:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:49:21,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:49:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:21,648 INFO L225 Difference]: With dead ends: 98 [2019-11-24 04:49:21,649 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:49:21,650 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:49:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:49:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-24 04:49:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:49:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2019-11-24 04:49:21,669 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 9 [2019-11-24 04:49:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:21,669 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2019-11-24 04:49:21,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:49:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2019-11-24 04:49:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:49:21,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:21,674 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:49:21,675 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:49:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash -752155905, now seen corresponding path program 1 times [2019-11-24 04:49:21,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:21,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113936970] [2019-11-24 04:49:21,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:21,963 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:49:21,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113936970] [2019-11-24 04:49:21,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:21,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:21,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600010728] [2019-11-24 04:49:21,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:49:21,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:49:21,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:49:21,968 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 4 states. [2019-11-24 04:49:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:22,261 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2019-11-24 04:49:22,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:49:22,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 04:49:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:22,263 INFO L225 Difference]: With dead ends: 136 [2019-11-24 04:49:22,263 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 04:49:22,264 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:49:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 04:49:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-11-24 04:49:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-24 04:49:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2019-11-24 04:49:22,275 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 13 [2019-11-24 04:49:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:22,276 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2019-11-24 04:49:22,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:49:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2019-11-24 04:49:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:49:22,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:22,277 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:49:22,277 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:49:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash -399366054, now seen corresponding path program 1 times [2019-11-24 04:49:22,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:22,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980820797] [2019-11-24 04:49:22,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:22,361 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:49:22,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980820797] [2019-11-24 04:49:22,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:22,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:22,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776289556] [2019-11-24 04:49:22,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:49:22,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:49:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:49:22,364 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand 3 states. [2019-11-24 04:49:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:22,387 INFO L93 Difference]: Finished difference Result 249 states and 388 transitions. [2019-11-24 04:49:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:49:22,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:49:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:22,390 INFO L225 Difference]: With dead ends: 249 [2019-11-24 04:49:22,390 INFO L226 Difference]: Without dead ends: 166 [2019-11-24 04:49:22,391 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:49:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-24 04:49:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2019-11-24 04:49:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-24 04:49:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 217 transitions. [2019-11-24 04:49:22,407 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 217 transitions. Word has length 18 [2019-11-24 04:49:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:22,407 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 217 transitions. [2019-11-24 04:49:22,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:49:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 217 transitions. [2019-11-24 04:49:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:49:22,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:22,409 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:49:22,409 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:49:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash -795820371, now seen corresponding path program 1 times [2019-11-24 04:49:22,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:22,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194178014] [2019-11-24 04:49:22,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:22,464 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:49:22,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194178014] [2019-11-24 04:49:22,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:22,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:22,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56085411] [2019-11-24 04:49:22,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:49:22,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:49:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:49:22,467 INFO L87 Difference]: Start difference. First operand 131 states and 217 transitions. Second operand 3 states. [2019-11-24 04:49:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:22,485 INFO L93 Difference]: Finished difference Result 385 states and 639 transitions. [2019-11-24 04:49:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:49:22,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:49:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:22,488 INFO L225 Difference]: With dead ends: 385 [2019-11-24 04:49:22,488 INFO L226 Difference]: Without dead ends: 256 [2019-11-24 04:49:22,489 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:49:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-24 04:49:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2019-11-24 04:49:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-24 04:49:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 381 transitions. [2019-11-24 04:49:22,540 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 381 transitions. Word has length 19 [2019-11-24 04:49:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:22,541 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 381 transitions. [2019-11-24 04:49:22,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:49:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 381 transitions. [2019-11-24 04:49:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:49:22,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:22,542 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:49:22,543 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:49:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1645957512, now seen corresponding path program 1 times [2019-11-24 04:49:22,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:22,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493877111] [2019-11-24 04:49:22,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:22,613 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:49:22,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493877111] [2019-11-24 04:49:22,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:22,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:22,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344974168] [2019-11-24 04:49:22,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:49:22,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:49:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:49:22,616 INFO L87 Difference]: Start difference. First operand 221 states and 381 transitions. Second operand 3 states. [2019-11-24 04:49:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:22,639 INFO L93 Difference]: Finished difference Result 651 states and 1123 transitions. [2019-11-24 04:49:22,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:49:22,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:49:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:22,643 INFO L225 Difference]: With dead ends: 651 [2019-11-24 04:49:22,643 INFO L226 Difference]: Without dead ends: 432 [2019-11-24 04:49:22,644 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:49:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-24 04:49:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 397. [2019-11-24 04:49:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-24 04:49:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 697 transitions. [2019-11-24 04:49:22,665 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 697 transitions. Word has length 20 [2019-11-24 04:49:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:22,665 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 697 transitions. [2019-11-24 04:49:22,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:49:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 697 transitions. [2019-11-24 04:49:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:49:22,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:22,667 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:49:22,667 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:49:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:22,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2136056943, now seen corresponding path program 1 times [2019-11-24 04:49:22,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:22,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735973852] [2019-11-24 04:49:22,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:22,752 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:49:22,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735973852] [2019-11-24 04:49:22,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:22,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:22,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774654713] [2019-11-24 04:49:22,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:49:22,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:22,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:49:22,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:49:22,754 INFO L87 Difference]: Start difference. First operand 397 states and 697 transitions. Second operand 3 states. [2019-11-24 04:49:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:22,893 INFO L93 Difference]: Finished difference Result 1171 states and 2055 transitions. [2019-11-24 04:49:22,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:49:22,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:49:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:22,898 INFO L225 Difference]: With dead ends: 1171 [2019-11-24 04:49:22,898 INFO L226 Difference]: Without dead ends: 776 [2019-11-24 04:49:22,899 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:49:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-11-24 04:49:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 741. [2019-11-24 04:49:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-11-24 04:49:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1305 transitions. [2019-11-24 04:49:22,937 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1305 transitions. Word has length 21 [2019-11-24 04:49:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:22,938 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1305 transitions. [2019-11-24 04:49:22,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:49:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1305 transitions. [2019-11-24 04:49:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:49:22,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:22,942 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:49:22,943 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:49:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1478177959, now seen corresponding path program 1 times [2019-11-24 04:49:22,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:22,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311877261] [2019-11-24 04:49:22,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:22,997 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:49:22,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311877261] [2019-11-24 04:49:22,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:22,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:49:22,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084426412] [2019-11-24 04:49:22,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:49:22,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:49:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:49:22,999 INFO L87 Difference]: Start difference. First operand 741 states and 1305 transitions. Second operand 3 states. [2019-11-24 04:49:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:23,070 INFO L93 Difference]: Finished difference Result 2187 states and 3847 transitions. [2019-11-24 04:49:23,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:49:23,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:49:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:23,079 INFO L225 Difference]: With dead ends: 2187 [2019-11-24 04:49:23,080 INFO L226 Difference]: Without dead ends: 1448 [2019-11-24 04:49:23,081 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:49:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-11-24 04:49:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1413. [2019-11-24 04:49:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-11-24 04:49:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2473 transitions. [2019-11-24 04:49:23,148 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2473 transitions. Word has length 22 [2019-11-24 04:49:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:23,148 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 2473 transitions. [2019-11-24 04:49:23,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:49:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2473 transitions. [2019-11-24 04:49:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:49:23,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:23,150 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:49:23,150 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:49:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1615259488, now seen corresponding path program 1 times [2019-11-24 04:49:23,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:23,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246112729] [2019-11-24 04:49:23,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:23,316 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:49:23,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246112729] [2019-11-24 04:49:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:23,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:49:23,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246874059] [2019-11-24 04:49:23,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:49:23,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:49:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:49:23,319 INFO L87 Difference]: Start difference. First operand 1413 states and 2473 transitions. Second operand 6 states. [2019-11-24 04:49:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:23,912 INFO L93 Difference]: Finished difference Result 2852 states and 4975 transitions. [2019-11-24 04:49:23,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:49:23,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-24 04:49:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:23,932 INFO L225 Difference]: With dead ends: 2852 [2019-11-24 04:49:23,932 INFO L226 Difference]: Without dead ends: 2825 [2019-11-24 04:49:23,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:49:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2019-11-24 04:49:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2794. [2019-11-24 04:49:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2019-11-24 04:49:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4911 transitions. [2019-11-24 04:49:24,075 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4911 transitions. Word has length 23 [2019-11-24 04:49:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:24,075 INFO L462 AbstractCegarLoop]: Abstraction has 2794 states and 4911 transitions. [2019-11-24 04:49:24,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:49:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4911 transitions. [2019-11-24 04:49:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:49:24,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:24,077 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:49:24,077 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:49:24,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1614475155, now seen corresponding path program 1 times [2019-11-24 04:49:24,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:24,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908425863] [2019-11-24 04:49:24,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:24,251 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:49:24,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908425863] [2019-11-24 04:49:24,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:49:24,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:49:24,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139344360] [2019-11-24 04:49:24,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:49:24,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:49:24,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:49:24,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:49:24,254 INFO L87 Difference]: Start difference. First operand 2794 states and 4911 transitions. Second operand 7 states. [2019-11-24 04:49:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:25,435 INFO L93 Difference]: Finished difference Result 3533 states and 6184 transitions. [2019-11-24 04:49:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:49:25,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-24 04:49:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:25,459 INFO L225 Difference]: With dead ends: 3533 [2019-11-24 04:49:25,459 INFO L226 Difference]: Without dead ends: 3531 [2019-11-24 04:49:25,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:49:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2019-11-24 04:49:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3488. [2019-11-24 04:49:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-11-24 04:49:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 6136 transitions. [2019-11-24 04:49:25,764 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 6136 transitions. Word has length 23 [2019-11-24 04:49:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:49:25,765 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 6136 transitions. [2019-11-24 04:49:25,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:49:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 6136 transitions. [2019-11-24 04:49:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:49:25,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:49:25,767 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:49:25,767 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:49:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:49:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1782472589, now seen corresponding path program 1 times [2019-11-24 04:49:25,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:49:25,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807483659] [2019-11-24 04:49:25,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:49:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:49:25,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807483659] [2019-11-24 04:49:25,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395256969] [2019-11-24 04:49:25,934 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:49:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:49:26,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 04:49:26,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:49:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:49:26,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:49:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:49:26,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549134855] [2019-11-24 04:49:26,415 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-24 04:49:26,415 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:49:26,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:49:26,428 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:49:26,429 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:50:11,278 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 675 [2019-11-24 04:50:14,974 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 314 DAG size of output: 255 [2019-11-24 04:50:15,366 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 720 [2019-11-24 04:50:15,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8